Apple Division

#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <vector>

using namespace std;

long long dfs(long long leftsum, long long rightsum, int i, int n, vector<long long> &vec)
{
    if (i == n)
    {   
        return std::abs(leftsum - rightsum);
    }
    else
    {
        int left = dfs(leftsum + vec[i], rightsum, i + 1, n, vec);
        int right = dfs(leftsum, rightsum + vec[i], i + 1, n, vec);

        return std::min(left, right);
    }
}


int main(){
    int a, i;
    long long b;

    cin >> a;

    vector<long long> w(a);

    i = 0;
    while (cin >> b)
    {
        w[i++] = b;
    }

    long long smallest_diff = dfs(0, 0, 0, a, w);

    cout << smallest_diff;

    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