#include <bits/stdc++.h> using namespace std; int a, b[25], ans = 1000000000, s = 0, t; void dfs(int n, int l, int r){//无返回值 if(n > a){ if(abs(l - r) < ans) ans = abs(l - r); return ; } dfs(n +1, l + b[n], r); dfs(n +1, l, r + b[n]); } int main(){ cin>>a; for(int i = 1; i <= a; i++){ cin>>b[i]; s += b[i]; } sort(b +1, b + a +1); dfs(1, 0, 0);//不需要返回值 cout<<ans<<endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> values(n); for (int i = 0; i < n; ++i) { cin >> values[i]; } int sum = 0; for (int i = 0; i < n; ++i) { sum += values[i]; }bool dp[sum + 1] = {false}; dp[0] = true; for (int i = 0; i < n; ++i) { for (int j = sum; j >= values[i]; --j) { dp[j] = dp[j] || dp[j - values[i]]; } }int half_sum = sum / 2; while (!dp[half_sum]) { --half_sum; }cout << sum - 2 * half_sum << endl; return 0; }