a thief is robbing a store that has n items. the ith item is worth dollars, weighs pounds and can be grabbed in time, where , and are integers. he wants to take as valuable a load as possible, but he can carry at most pounds in his knapsack, and can only spend time before the police arrive. which items should he take to maximize the total value? all values involved are integers.