【NYOJ 325】

题目链接：http://acm.nyist.net/JudgeOnline/problem.php?pid=325

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
#define max(a,b) (a>b?a:b)
int a[25],dp[100005];
int main(){
    int sum,n;
    while(scanf("%d",&n)!=EOF){
        sum=0;
        memset(dp,0,sizeof(dp));
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
            sum+=a[i];
        }
        int k=sum/2;
        for(int i=0;i<n;i++)
        for(int j=k;j>=a[i];j--){
            dp[j]=max(dp[j],dp[j-a[i]]+a[i]);
        }
        printf("%d\n",sum-dp[k]*2);
    }
}