Ice cream

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
ll M[1005];
ll V[1005];
int main()
{
    //ifstream cin("in.in");
    ll n,k;
    cin>>n>>k;
    ll l=0;
    for(ll i=0;i<n;i++){
        cin>>M[i]>>V[i];
    }
    for(ll i=0;i<n;i++){
        for(ll j=i;j<n;j++){
            if(M[i]+M[j]<=k){
                l=max(l,V[i]+V[j]);
            }
        }
    }
    cout<<l;
}

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