Ice cream

/usr/bin/ld.bfd: warning: output/link.res contains output sections; did you forget -T?

  Uses Math;
  
  var N , X : LongInt;
      P , W : array [ 1 .. 100 ] of LongInt;
      i , j : LongInt;
      
      ans : LongInt;
      
begin
  readLn ( N , X ) ; 
  
  for i := 1 to N do
    readLn ( P[i] , W[i] ) ; 
  
  Ans := -1;
  
  for i := 1 to N do
    for j := i to N do
      if ( P[i] + P[j] <= X ) then
      begin
        Ans := Max ( Ans , W[i]+W[j] );
      end;
  
  writeLn ( Ans ) ; 
end.

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