i,j,k,m,n,w,q:longint;

s:array[0..10001]of longint;

begin

readln(n,m);

for i:=1 to m do s[i]:=-maxlongint;

s[0]:=0;

for i:=1 to n do

begin

readln(w,q);

for j:=w to m do

if s[j-w]+q>s[j] then

s[j]:=s[j-w]+q;

end;

writeln(s[m]);

end.

为什么一定要初始化到-maxlongint才对

那题？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？