結果 : explain 0 1 knapsack problem solution using dynamic programming