結果 : 0/1 knapsack problem using dynamic programming time complexity