正整数分组

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdio>
#define _xx ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
typedef long long ll;
int dp[10005], a[105];
int main()
{_xx
    int n, sum;
    while(cin >> n)
    {
        sum = 0;
        memset(dp, 0, sizeof dp);
        dp[0] = 1;
        for(int i = 1; i <= n; i++)
        {
            cin >> a[i];
            sum += a[i];
        }
        for(int i = 1; i <= n; i++)
            for(int j = sum; j >= a[i]; j--)
                dp[j] = dp[j -a[i]] | dp[j];
        int ans = 1000000;
        for(int i = 0; i <= sum; i++)
            if(dp[i] == 1) ans = min(ans, abs(sum - i - i));
        cout << ans << endl;
    }
    return 0;
}