数据量较小，直接深搜解决

#include <bits/stdc++.h>

using namespace std;

int arr[105],n;
int ans = INT_MAX;

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

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

return 0;

}