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<int> dp(LIM, INF);
    int answ = 0;
 
    dp[0] = 0;
    for (int j = 0; j < n; j++) {
        for (int i = LIM - 1; i >= ice[j].s; i--) {
            dp[i] = min(dp[i], dp[i - ice[j].s] + ice[j].f);
            if (dp[i] <= x) {
                answ = max(answ, i);
            }
        }
    }
 
    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