题解

#include <bits/stdc++.h>

using namespace std;

int a[101],n,ans=0x3f3f3f3f;

void dfs(int x,int wealth1,int wealth2){
    if (x == n){
   		ans = (ans < abs(wealth1 - wealth2)) ? ans : abs(wealth1 - wealth2);
    	return;
    }
    dfs(x + 1,wealth1 + a[x],wealth2);
    dfs(x + 1,wealth1,wealth2 + a[x]);
    return;
}

int main(){
    cin >> n;
    for (inlinet i = 0;i < n;i++)
    cin >> a[i];
    dfs(0,0,0);
    cout << ans;
    return 0;
}

途中还出了一个笑话：

#include <bits/stdc++.h>

using namespace std;

int a[101],n,ans=0x3f3f3f3f;

void dfs(int x,int wealth1,int wealth2){
    if (x == n){
   		ans = (ans < abs(wealth1 - wealth2)) ? ans : abs(wealth1 - wealth2);
    	return;
    }
    dfs(x + 1,welath1 + a[x],wealth2);
    dfs(x + 1,wealth1,wealth2 + a[x]);
    return;
}

int main(){
    cin >> n;
    for (inlinet i = 0;i < n;i++)
    cin >> a[i];
    dfs(0,0,0);
    cout << ans;
    return 0;
}

你能找到不同吗？