题目传送门
代码:
#include<bits/stdc++.h>
using namespace std;
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define ls (rt<<1)
#define rs (rt<<1|1)
#define pb push_back
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define MEM(a,b,start,end) for(int ii=start;ii<=end;ii++) a[ii]=b
#define low(x) (x&(-x))
#define v(x) vector<x>
#define Map1(a,b) map<a,b>
#define Map2(a,b) unordered_map<a,b>
#define pqg(x) priority_queue<x,vector<x>,greater<x> >
#define pql(x) priority_queue<x,vector<x>,less<x> >
typedef unsigned long long ULL;
typedef long long LL;
typedef double D;
typedef complex<double> COMD;
const int maxn=10000+100;
int dp[maxn];
int w[110],v[110];
int main(){
int n;
scanf("%d",&n);
int sum=0;
for(int i=0;i<n;i++) scanf("%d",&w[i]),v[i]=w[i],sum+=w[i];
int W=sum/2;
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++){
for(int j=W;j>=w[i];j--) dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
}
printf("%d\n",sum-2*dp[W]);
}