Ice cream

#include <iostream>
using namespace std;

int W;
int w[107];
int h[107];
int n;

int main() {
	ios_base::sync_with_stdio(0);
	cin >> n >> W;
	for(int i = 1; i <= n; ++i) cin >> w[i] >> h[i];
	int wyn = 0;
	for(int i = 1; i <= n; ++i) {
		for(int j = i; j <= n; ++j) {
			if(w[i] + w[j] <= W) wyn = max(wyn, h[i] + h[j]);
		}
	}
	cout << wyn << endl;
	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