結果 : greedy algorithm for 0 1 knapsack problem