Apple Division

#include <bits/stdc++.h>
using namespace std;
#define ln "\n"
typedef long long ll;
#define fastio ios_base::sync_with_stdio(false), cin.tie(NULL)


vector<int> subset;
vector<int> weights;



int main() {

    int n;
    ll sum;
    sum = 0;
    cin >> n;
    
    for(int i = 0; i <n; i++){
        int a;
        cin >> a;
        weights.push_back(a);
        sum+= a;
    }

    int res = 1e9;

    if(n == 1){
        cout << weights[0];
    }else{

        for (int b = 0; b < (1<<n); b++){

            ll curSum = 0;

            vector<int> subset;
            for(int i = 0; i < n; i++){

            if (b&(1<<i)){
                subset.push_back(weights[i]);
                curSum += weights[i];
            }
            

            
            }

            res = min((int)(abs(sum / 2.0 - curSum)*2), res);
        

        }

        cout << res << ln;

    }

    



    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: ACCEPTED