Apple Division

#include "bits/stdc++.h"

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define F first
#define S second
#define PB push_back
#define MP make_pair

#define REP(i,a,b) for (int i = a; i < b; i++)

// const int N = 60000;
// ll inputs[N];

int solve(vector<ll> &weights, int idx, int n, ll sum) {
    ll w = weights[idx];
    if(idx == n-1) {
        return min(llabs(sum + w), llabs(sum - w));
    } else {
        ll incl = solve(weights, idx + 1, n, sum + w);
        ll excl = solve(weights, idx + 1, n, sum - w);
        return min(incl, excl);
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;

    vector<ll> inputs(n);

    REP(i, 0, n) {
        cin >> inputs[i];
    }

    ll minim = solve(inputs, 0, n, 0);
    cout << minim << "\n";

    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