九度oj 1420：Jobdu MM分水果

#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdlib>
using namespace std;
int main()
{
int n;
while(cin>>n)
{
int *a=new int
;
int i,j,sum=0;
for(i=0;i<n;i++) cin>>a[i],sum+=a[i];
int total=sum>>1;
int *bag=new int[total+2];
memset(bag,0,sizeof(int)*(total+2));
for(i=0;i<n;i++)
for(j=total;j>=a[i];j--)
{
bag[j]=max(bag[j],bag[j-a[i]]+a[i]);//背包
}
//cout<<bag[total]<<endl;
cout<<abs(sum-2*bag[total])<<endl;
delete a;
delete bag;
}
return 0;
}