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[];
 int n;
 ll dp[];

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