Apple Division

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


long long memo(vector<vector<long long>> & dp, long long index, long long cap, vector<long long> & apples) {
    //cout << "On index " << index << " capacity: " << cap << '\n';
    if (index<0){
        return 0;
    }
    if (cap<=0){
        return 0;
    }

    if (dp[index][cap]==-1){
        if (cap>=apples[index]){

            dp[index][cap]=max(memo(dp, index-1, cap-apples[index], apples)+apples[index], memo(dp, index-1, cap, apples));
        } else {
            dp[index][cap]=memo(dp, index-1, cap, apples);
        }
    }

    return dp[index][cap];

}

int main(){
    long long n;
    cin >> n;
    vector<long long> apples (n);
    long long sum = 0;
    for (long long i=0; i<n;i++){
        cin >> apples[i];
        //sum+=apples[i];
    }

    sort(apples.begin(), apples.end(), greater<int>());

    int val1=0, val2=0;

    for (int i=0;i<n;i++){
        //cout << i << " " << val1 << " " << val2 << '\n';
        if (val1<=val2){
            val1+=apples[i];
        } else {
            val2+=apples[i];
        }
    }

    cout << max(val1, val2)-min(val2, val1) << '\n';

    return 0;

    vector<vector<long long>> dp(n, vector<long long>((sum/2)+1, -1));

    long long group1=memo(dp, n-1, sum/2, apples);
    cout << (sum-group1)-group1 << '\n';

    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