51Nod 1007 正整数分组

//Asimple
#include <bits/stdc++.h>
//#define INF 0x3fffffff
#define mod 1000000
#define swap(a,b,t) t = a, a = b, b = t
#define CLS(a, v) memset(a, v, sizeof(a))
#define debug(a)  cout << #a << " = "  << a <<endl
#define test() cout<<"=========="<<endl
using namespace std;
typedef long long ll;
const int maxn = 10000+5;
const double PI=acos(-1.0);
const int INF = ( 1 << 20 ) ;
const int dx[] = {-1, 0, 1, 0};  
const int dy[] = { 0,-1, 0, 1}; 
ll n, m, res, ans, len, T, k, num, sum;
int dp[maxn], a[maxn];

void input() {
    ios_base::sync_with_stdio(false);
    cin >> n;
    sum = 0;
    for(int i=0; i<n; i++) {
        cin >> a[i];
        sum += a[i];
    }
    CLS(dp, 0);
    for(int i=0; i<n; i++) {
        for(int j=sum/2; j>=a[i]; j--) {
            dp[j] = max(dp[j], dp[j-a[i]]+a[i]);
        }
    }
    cout << abs(sum-dp[sum/2]-dp[sum/2]) << endl;
}

int main(){
    input();
    return 0;
}