Jäätelö

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main() {
     int n, x, h, p;
     vector<pair<int, int> > v;
     cin >> n >> x;
     int a[101010];
     int b[101010];
     for (int i = 0; i<n; i++) {
     	cin >> h >> p;
     	a[i] = h;
     	b[i] = p;
     }
     for (int i = 0; i<n; i++) {
         for (int j = 0; j<n; j++) {
         	v.push_back(make_pair(b[i]+b[j], a[i]+a[j]));
         }
     }
     
     sort(v.rbegin(), v.rend());
     int pa, hi;
     for (int i = 0; i<=n*n; i++) {
     	pa = v[i].first;
     	hi = v[i].second;
     	if (hi <= x) {
     		cout << pa << "\n";
     		return 0;
     	}
     }
     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