- POJ 1276, turn bounded knapsack to 0-1 knapsack, but “Time Limit Exceeded”
- optimize time spent to O(W∑log n), W is bag’s max capable weight, n is every item’s number in bounded knapsack problem