高效算法——Most financial institutions 贪心 H

#include <cstdio>
#include <algorithm>
using namespace std;
const int MAX=100010;
long long sum;
int n,i;
int b[MAX];
struct node
{
int x,y;

}a[MAX];
bool cmp(node a,node b)
{
return a.x>b.x;
}
bool  init()
{
sum=0;
for(int i=0;i<n;i++)
{
scanf("%d",&a[i].x);
a[i].y=i;
b[i]=-1;
sum+=a[i].x;
}
if(sum%2) return true;
else return false;
}
void solve()
{
sort(a,a+n,cmp);
long long num=0;
for( i=0;i<n;i++)
{
if(num+a[i].x<=sum/2)
{
num+=a[i].x;
b[a[i].y]=1;
if(num==sum/2) break;
}
}
}
void print()
{

for( i=0;i<n-1;i++)
{
printf("%d ",b[i]);
}
printf("%d\n",b[n-1]);
}
int main()
{
while( scanf("%d",&n)==1)
{
if(init()||n==1)  printf("No\n");
else
{
printf("Yes\n");
solve();
print();
}
}
return 0;
}