CS 215 Knapsack Programming Assignment
Write a program to implement the Knapsack algorithm with dynamic
programming and reconstruction to obtain the elements that get selected
for the solution. Here are some test
data files you can use. The first line of the file should be an
integer n that represents the number of items in the problem
set. The second line shoudl be C, the total capacity. Each
line after that should have three numbers: i - the item number,
pi - the profit for item i, and
wi - the weight of item i.