Apple Division

#include<iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <numeric>
using namespace std;

#include <bits/stdc++.h>
int main() {
    vector<int> v, res;
    
    int n,input;
    // int min = std::numeric_limits<int>::max();
 
    cin >> n;

    if (n < 1 || n > 20)
        return (0);
 
    for (int i = 0; i < n; i++)
    {
        cin >> input;
        if (input < 1 || input > std::pow(10, 9))
            return (0);
        v.push_back(input);
    }
    
    sort(v.begin(),v.end());
 

    int sum = accumulate(v.begin(), v.end() - 1, 0);
    int last = n - 1;
    int last_sum = v[last];

    int prev = 0;
    for (int i = 0; static_cast<size_t>(i) < v.size(); ++i) {
        prev = sum - last_sum;
        sum -= v[i];
        last_sum += v[i];
        if (sum - last_sum < 0)
            break;
    }
    std::cout << std::abs(prev);
    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: WRONG ANSWER

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