結果 : knapsack problem using dynamic programming time complexity