1007 正整数分组

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<cmath>
#include<vector>
#include<string>
using namespace std;
typedef long long LL;
#define M 1000000007
int a[105];
int dp[105][105];
int main()
{
    int t,sum=0;
    scanf("%d",&t);
    for(int i=0;i<t;i++)
    {
        scanf("%d",&a[i]);
        sum+=a[i];
    }
    int m=M,aim,cnt=1,temp=sum;
    while(temp%10==0)
    {
        cnt*=10;
        temp/=10;
    }
    aim = temp/2*cnt;
    sort(a,a+t);
    for(int i=0;i<t;i++)
    {
        if(i==0)
            dp[0][1] = a[i];
        else
        {
            dp[i][0] = dp[i-1][0];
            for(int j=1;j<=t;j++)
            {
                dp[i][j] = max(dp[i-1][j],dp[i-1][j-1]+a[i]);            
                if(dp[i][j]-aim>=0)
                    m = min(m,dp[i][j]-aim);
            }
        }
    }
    // 150 75 15 sum-aim-m
    int M1 = max(sum-aim-m,aim+m),M2 = min(sum-aim-m,aim+m);
    printf("%d",M1-M2);
    return 0;
}

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;

const int N=105;

int n,a[N],Sum,Su,dp[N*100];

int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]),Sum+=a[i];
Su=Sum/2;
for(int i=1;i<=n;i++){
    for(int j=Su;j>=a[i];j--)dp[j]=max(dp[j],dp[j-a[i]]+a[i]);
}
printf("%d\n",Sum-2*dp[Su]);
return 0;
}