Cod sursa(job #1690139)
| Utilizator | Data | 14 aprilie 2016 20:13:42 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 10 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
program rucsac;
var i, j, g, n, m : longint;
w, p : array[1..5000] of integer;
a : array[0..10000] of integer;
begin
assign(input, 'rucsac.in');
reset(input);
read( n, g);
for i:=1 to n do read( w[i], p[i]);
a[0]:=0; m:=0;
for i:=1 to n do begin
for j:=g downto w[i] do begin
if a[j-w[i]]+p[i]>a[j] then a[j]:=a[j-w[i]]+p[i];
if m<a[j] then m:=a[j];
end; end;
assign(output, 'rucsac.out');
rewrite(output);
write(m);
end.