Jäätelö

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	
	int n, x, h, p, m = 0;
	cin >> n >> x;
	vector<pair<int, int>> v(n);
	
	for(int i = 0; i < n; i++) {
		cin >> h >> p;
		v[i] = make_pair(p, h);
	}
	
	for(int i = 0; i < n; i++)
		for(int j = 0; j < n; j++)
			if(v[i].second + v[j].second <= x)
				m = max(m, v[i].first + v[j].first);
	
	cout << m << endl;
}

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