TC SRM 593 DIV2 1000

很棒的DP，不过没想出，看题解了。。思维很重要。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int dp[1000010];
int sum[51];
class MayTheBestPetWin
{
    public :
    int calc(vector <int> A, vector <int> B)
    {
        int i,j,s1,s2;
        s1 = s2 = 0;
        memset(dp,-1,sizeof(dp));
        dp[0] = 0;
        for(i = 0;i < A.size();i ++)
        {
            sum[i] = A[i] + B[i];
        }
        for(i = 0;i < A.size();i ++)
        {
            s1 += A[i];
            s2 += B[i];
            for(j = 1000000;j >= sum[i];j --)
            {
                if(dp[j-sum[i]] != -1&&dp[j] <= dp[j-sum[i]] + sum[i])
                {
                    dp[j] = dp[j-sum[i]] + sum[i];
                }
            }

        }
        int minz = 10000000,t1,t2;
        for(i = 1;i <= 1000000;i ++)
        {
            if(dp[i] != -1)
            {
                t1 = abs(s1-i);
                t2 = abs(s2-i);
                minz = min(minz,max(t1,t2));
            }
        }
        return minz;
    }
};