![](https://img.laitimes.com/img/9ZDMuAjOiMmIsIjOiQnIsIiclRnblN0LclHdpZXYyd2LcBzNvwVZ2x2bzNXak9CX90TQNNkRrFlQKBTSvwFbslmZvwFMwQzLcVmepNHdu9mZvwFVywUNMZTY18CX052bm9CX9sGRNpXTU9EeNpXTmZEWjZXUYpVd1kmYr50MZV3YyI2cKJDT29GRjBjUIF2LcRHelR3LcJzLctmch1mclRXY39zNzADNzIzM5EDOyETM3EDMy8CX0Vmbu4GZzNmLn9Gbi1yZtl2Lc9CX6MHc0RHaiojIsJye.jpg)
求n個數能組合成最接近總和的一半
然後0-1背包。判斷最接近一半值的數
#include<iostream>
#include<queue>
#include<vector>
#include<stack>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
int n;
cin>>n;
int a[101];
int sum=0;
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
int fz=sum;
sum=sum/2;
int f[10010]={0};
for(int i=0;i<n;i++){
for(int j=sum;j>=a[i];j--){
f[j]=max(f[j],f[j-a[i]]+a[i]);
}
}
cout<<abs(fz-2*f[sum]);
return 0;
}