結果 : write an algorithm for 0 1 knapsack problem using dynamic programming