Cod sursa(job #653719)
| Utilizator | Data | 28 decembrie 2011 18:25:23 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
var f,g:text;
a:array[0..10000] of longint;
max,n,i,j,k,x,m:longint;
begin
max:=-maxint;
assign(f,'rucsac.in');reset(f);
assign(g,'rucsac.out');rewrite(g);
readln(f,n,k);
for i:=1 to n do begin
readln(f,x,m);
for j:=k-x downto 0 do if (a[j]>0)then begin
if (a[j]+m>a[j+x]) then a[j+x]:=a[j]+m;
if max<a[j+x] then max:=a[j+x];end;
if (m>a[x]) then a[x]:=m;
if max<a[x] then max:=a[x];
end;
writeln(g,max);
close(g);
end.