uva 10032 Problem F: Tug of War

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=973

#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
using namespace std;

int w[5000];
int n;
ll dp[50000];

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        int sum=0;
        for(int i=0; i<n; i++)
        {
            scanf("%d",&w[i]);
            sum+=w[i];
        }
        memset(dp,0,sizeof(dp));
        dp[0]=1;
        for(int i=0; i<n; i++)
        {
            for(int j=sum; j>=w[i]; j--)
            {
                dp[j] |= dp[j-w[i]]<<1;
            }
        }
        int ans1=0,ans2=0x3f3f3f3f;
        for(int i=0; i<=sum; i++)
        {
            for(int j=0; j<=(n+1)/2; j++)
            {
                if(dp[i]&(1ll<<j) && abs(2*j-n)<=1)
                {
                    if(abs(sum-2*i)<ans2-ans1)
                    {
                        ans2=max(sum-i,i);
                        ans1=min(sum-i,i);
                    }
                }
            }
        }
        printf("%d %d
",ans1,ans2);
        if(t) printf("
");
    }
    return 0;
}