Apple Division

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

using namespace std;

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

    cin >> a;

    vector<int> w(a);

    i = 0;
    while (cin >> b)
    {
        w[i++] = b;
    }
    std::sort(w.begin(), w.end());

    int left = 0;
    int right = 0;

    i = a - 1;
    while (i >= 0)
    {
        if (left <= right)
        {
            left += w[i];
        }
        else
        {
            right += w[i];
        }
        --i;
    }

    cout << abs(left - right);

    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

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