You have N items that you want to put them into a knapsack. Item i has value vi and weight wi.
You want to find a subset of items to put such that:
Find the maximum total value of items in the knapsack.
N W v1 w1 v2 w2 : vN wN
The first line consists of the integers N and W. In the following lines, the value and weight of the i-th item are given.
Print the maximum total values of the items in a line.
4 5 4 2 5 2 2 1 8 3
2 20 5 9 4 10