有一堆石头质量分别为W1,W2,W3...WN.(W＜＝100000)现在需要你将石头合并为两堆，使两堆质量的差为最小。

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cstdio>

using namespace std;

int main(){
    int n;
    cin >>n;
    vector<int> stone(n+1,0);
    int sum = 0;
    for(int i = 1; i <= n; i ++){
        cin >> stone[i];
        sum += stone[i];
    }
    vector<int> dp(sum/2+1,0);
    for(int i =1; i <= n; i ++){
        for(int j = sum/2; j >= stone[i]; j --){
            dp[j] = max(dp[j-stone[i]]+stone[i],dp[j]);
        }
    }
    cout<<sum-2*dp[sum/2]<<endl;

    return 0;
}