Cod sursa(job #1132164)
Utilizator | Data | 2 martie 2014 19:47:34 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
program p21;
var a:array[0..10000] of longint;
f,g:text;
n,i,g1,p1,j,gr:longint;
begin
assign(f,'rucsac.in');reset(F);
assign(g,'rucsac.out');rewrite(G);
readln(f,n,g1);
for i:=1 to n do begin
readln(f,gr,p1);
for j:=g1-gr downto 0 do
if a[j+gr]<a[j]+p1 then a[j+gr]:=a[j]+p1;
end;
writeln(g,a[g1]);
close(F);
close(G);
end.