Apple Division

#include <iostream>
#include <vector>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;


long  difference(vector<int>& v, int i, long sum1, long sum2, int n){
    if (i == n){
        return abs(sum1 - sum2);
    }
    
    return min( difference(v, i+1, sum1 + v[i], sum2, n),
            difference(v, i+1, sum1, sum2 + v[i], n));
}

int main() {
    

    int n, aux;
    vector<int> v;
    cin >> n;

    for (int i = 0; i < n; ++i)
    {
        cin >> aux;
        v.push_back(aux);
    }

    cout << difference(v, 0, 0, 0, n) << endl;;
}

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: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED