51nod-正整数分组

<span style="font-size:18px;">#include<cstdio>
#include<cstring>
int f[5000+11];
int a[110];
int max(int b,int c)
{
	if(b>c)
		return b;
	return c;
}
int main()
{
	int n;
	scanf("%d",&n);
	int sum=0;
	for(int i=1;i<=n;++i)
	{
		scanf("%d",&a[i]);
		sum+=a[i];
	}
	memset(f,0,sizeof(f));
	for(int i=1;i<=n;++i)
	{
		for(int j=sum/2;j>=a[i];--j)
			f[j]=max(f[j],f[j-a[i]]+a[i]);
	}
	printf("%d\n",sum-2*f[sum/2]);
	return 0;
} </span>