Chef and Fixed Deposits solution codechef
Chef wants to make a purchase. For this, he needsgold coins, but he has none at the moment.
Chef hasfixed deposits, the of which is worth coins. He wants to open the minimum number of these deposits so that he has at least coins.
You have to tell Chef the minimum number of fixed deposits he must open in order to havecoins, or say that this is impossible.
- The first line of input contains a single integer , denoting the number of test cases. The description of test cases follows.
- The first line of each test case contains two space-separated integers — and , as described in the statement.
- The second line of each test case contains space-separated integers — the of which is .
For each test case, output one line containing the answer — the minimum number of FDs Chef must open to have at leastcoins. If it is not possible for him to open FDs such that he has at least coins, output .
Subtask #1 (100 points): Original constraints
Sample Input 1
4 4 6 4 3 5 1 3 15 1 5 3 2 5 10 3 4 7 1 2 3 4
Sample Output 1
2 -1 1 2
Test case: Chef can open the first and second FDs to get coins.
Test case: No matter which FDs Chef opens, he cannot have coins, so the answer is .