Jäätelö

#include <iostream>

using namespace std;

int n, x;
int h[105];
int p[105];

int res = 0;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> x;
	for (int i = 0; i < n; ++i) {
		cin >> h[i] >> p[i];
	}
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			int ch = h[i]+h[j];
			if (ch > x) continue;
			res = max(res, p[i]+p[j]-1);
		}
	}
	cout << res << "\n";
	return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

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