Jäätelö

#include <iostream>
#include <algorithm>
 
using namespace std;
typedef long long ll;
 
int n, x;
 
ll h[1005];
ll p[1005];
 
ll mw = 0;
 
int main() {
    cin >> n >> x;
    for (int i = 0; i < n; ++i) {
        cin >> h[i];
        cin >> p[i];
    }
    
    for (int i = 0; i <  n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (h[i] + h[j] > x) continue;
            
            mw = max(mw, p[i]+p[j]);   
        }
    }
    cout << mw << "\n";
    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