Ice cream

#include <iostream>

using namespace std;

int n, x;
int h[100], p[100];
int dp[100][1001];

int main() {
    cin >> n >> x;
    for (int i = 0; i < n; ++i)
        cin >> h[i] >> p[i];

    /*for (int i = 0; i <= x; ++i)
        dp[0][i] = (i / h[0]) * p[0];
    for (int i = 1; i < n; ++i) {
        for (int j = 0; j <= x; ++j) {
            dp[i][j] = dp[i - 1][j];
            if (j >= h[i])
                dp[i][j] = max(dp[i][j], dp[i][j - h[i]] + p[i]);
        }
    }

    cout << dp[n - 1][x] << "\n";*/

    int result = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (h[i] + h[j] > x) continue;
            result = max(result, p[i] + p[j]);
        }
    }

    cout << result << "\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