結果 : example of 0 1 knapsack problem using dynamic programming