Silkroad Online Forums

Program Knapsack01;
Uses Crt;
Var
  i, j, n, c : integer;
  v, w : array [1..100] of integer;
  t : array [0..100, 0..100] of integer;

Function Max (x, y : integer) : integer;
Begin
  If x > y Then Max := x
  Else Max := y;
End;

Begin
ClrScr;
Write ('Capacity of knapsack: ');
Readln (c);
Write ('Number of items: ');
Readln (n);
Writeln ('Value and weight of every item: ');
For i := 1 to n Do
   Readln (v [i], w [i]);
For i := 0 to c Do
   t [0, i] := 0;
For i := 1 to n Do
   For j := 0 to c Do Begin
     If j >= w [i] Then t [i, j] := Max (t [i - 1, j], t [i - 1, j - w [i]] + v [i])
     Else t [i, j] := t [i - 1, j];
   End;
Writeln ('Solution: ', t [n, c]);
Readln;
Readln;
End.