拔河比赛

dp[j][k]=dp[j-1][k-w[i]

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
bool dp[51][45000];
int n,w[111],s;
int main()
{
    scanf("%d",&n);
    for(int i = 1;i <= n;i ++)  scanf("%d",&w[i]),s += w[i];
    dp[0][0] = 1;
    int k = (n+1)/2;
    for(int i = 1;i <= n;i ++)
        for(int j = k-1;j >= 0;j --)
            for(int v = 450*i;v >= 0;v --)
                if(dp[j][v])
                    dp[j+1][v+w[i]] = 1;

    for(int i=s/2;i>=1;i--)
    {
    //  printf("%d ",dp[w][i]);
        if(dp[k][i]) {
            printf("%d %d",i,s-i);return 0;
        }
    }

    return 0;
}