UVA 1614(p254)----Hell on the Markets

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100000+50;
struct point
{
    int v,pos,ans;
};
int n;
point a[maxn];
int cmp(point a,point b)
{
    return a.v<b.v;
}
int main()
{
    while(cin>>n)
    {
        long long sum=0;
        memset(a,0,sizeof(a));
        for(int i=0;i<n;i++){cin>>a[i].v;a[i].pos=i;sum+=a[i].v;}
        if(sum%2) cout<<"No"<<endl;
        else
        {
            sum/=2;
            sort(a,a+n,cmp);
            //for(int i=0;i<n;i++) cout<<a[i].v<<" "<<a[i].pos<<endl;
            for(int i=n-1;i>=0;i--)
            {
                if(sum>=a[i].v)
                {
                    sum-=a[i].v;
                    a[a[i].pos].ans=1;
                }
            }
            cout<<"Yes"<<endl;
            for(int i=0;i<n-1;i++)
              if(a[i].ans) cout<<1<<" ";
                else cout<<-1<<" ";
            if(a[n-1].ans) cout<<1<<endl;
            else cout<<-1<<endl;
        }
    }
    return 0;
}