Indiana Jones often faces difficult dilemmas in his travels. On his last journey into the crypt on a long-forgotten emperor he found countless treasures but he could only carry no more than N kilograms of loot on the way back. Help him make the most of the situation by solving the famous knapsack problem. Since he'll be using your program for some time, you are required to solve the problem using both dynamic programming AND branch & bound.
You must also be able to read the input from a file with the following structure:
item value weight For example:
chocolate 10 2 golden-horn 100 10 Skyrim 99999999999 5