Ice cream

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

int N, X;
int PRICE[101], WEIGHT[101];
int mem[101][1001][3];

int solve(int n, int x, int p) {
    if (x < 0) return -(1 << 30);
    if (p < 0) return -(1 << 30);
    if (n == N) return 0;
    if (mem[n][x][p] == -1) {
        mem[n][x][p] = max(solve(n+1, x, p), solve(n, x - PRICE[n], p-1) + WEIGHT[n]);
    }
    return mem[n][x][p];
}

int main() {
    cin >> N >> X;
    for (int i = 0; i < N; i++) {
        cin >> PRICE[i] >> WEIGHT[i];
    }
    memset(mem, -1, sizeof mem);
    cout << solve(0, X, 2) << "\n";

}

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