結果 : solve the 0 1 knapsack problem using dynamic programming