Ice cream

#include <bits/stdc++.h>
#define llong long long
#define f first
#define s second
#define mp make_pair
//#define cin fin

using namespace::std;

//ifstream fin("input.txt");

int INF = 2e6;
int LIM = 1e5 + 1;

int main()
{
    int n, x;
    cin >> n >> x;
    vector<pair<int, int> > ice(2 * n);
    for (int i = 0; i < n; i++) {
        cin >> ice[2 * i].f >> ice[2 * i].s; /// value, weight
        ice[2 * i + 1].f = ice[2 * i].f;
        ice[2 * i + 1].s = ice[2 * i].s;
    }
    n *= 2;
    vector<vector<int> > dp(n, vector<int> (LIM, INF));
    dp[0][0] = 0;
    dp[0][ice[0].s] = ice[0].f;
    int answ = 0;
    for (int i = 1; i < n; i++) {
        //cout << ice[i].f << " " << ice[i].s << "\n";
        dp[i][0] = 0;
        for (int j = 0; j < LIM; j++) {
            if (j >= ice[i].s) {
                //if (j  <= 10)
                //cout << i << " " << j << " " << dp[i - 1][j - ice[i].s] + ice[i].f << "\n";
                dp[i][j] = min(dp[i - 1][j - ice[i].s] + ice[i].f, dp[i - 1][j]);
            }
            else {
                dp[i][j] = dp[i - 1][j];
            }
            if (dp[i][j] <= x) {
                answ = max(answ, j);
            }
            //if (j <= 10)
            //cout << dp[i][j] << " ";
        }
        //cout << "\n";
    }
    cout << answ << "\n";

    //system("pause");
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

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