Ice cream

#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double llf;

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

int main(){
	cin >> n >> w;
	for(int i=0; i<n; i++) cin >> h[i] >> p[i];
	int ret = 0;
	for(int i=0; i<n; i++){
		for(int j=0; j<=i; j++){
			if(h[i] + h[j] <= w) ret = max(ret, p[i] + p[j]);
		}
	}
	cout << ret;
}

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