Ice cream

#include<bits/stdc++.h>
using namespace std;

int N,S,c[1007],w[1007],dp[1007][5];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> N >> S;

    for(int i=0;i<N;i++)
        cin >> c[i] >> w[i];

    for(int i=0;i<N;i++){
        for(int j=c[i];j<=S;j++){
            for(int k=1;k<=2;k++){
                dp[j][k] = max(dp[j-c[i]][k-1]+w[i],dp[j][k]);
            }
        }
    }

    int ans = max(dp[S][1],dp[S][2]);

    cout << ans << endl;

    return 0;
}

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