STAMPS  Stamps
Everybody hates Raymond. He’s the largest stamp collector on planet earth and because of that he always makes fun of all the others at the stamp collector parties. Fortunately everybody loves Lucy, and she has a plan. She secretly asks her friends whether they could lend her some stamps, so that she can embarrass Raymond by showing an even larger collection than his. Raymond is so sure about his superiority that he always tells how many stamps he’ll show.And since Lucy knows how many she owns, she knows how many more she needs. She also knows how many friends would lend her some stamps and how many each would lend. But she’s like to borrow from as few friends as possible and if she needs too many then she’d rather not do it at all. Can you tell her the minimum number of friends she needs to borrow from?
Input
The first line contains the number of scenarios. Each scenario describes one collectors party and its first line tells you how many stamps (from 1 to 1000000) Lucy needs to borrow and how many friends (from 1 to 1000) offer her some stamps. In a second line you’ll get the number of stamps (from 1 to 10000) each of her friends id offering.
Output
The output for every scenario begins with a line containing “Scenario #i:”, where i is the number of the scenario starting at 1. Then print a single line with the minimum number of friends Lucy needs to borrow stamps from. If it’s impossible even if she borrows everything from everybody, write impossible. Terminate the output for the scenario with a blank line.
Example
Input: 3 100 6 13 17 42 9 23 57 99 6 13 17 42 9 23 57 1000 3 314 159 265 Output: Scenario #1: 3 Scenario #2: 2 Scenario #3: impossible
hide comments
sarkybastard:
20201110 20:11:35
nobody caresssssssssssssssssssssssssssss!!!!!!!!!!!!!!!!!!!!!!!!!! 

kxbaphomet_666:
20201107 06:00:30
AC in one goooooooooooooooooooooooooo!!!!!!!!!!!!!!!!!!!!!! 

aditigedam:
20200830 15:56:34
check for it


manxmaniac:
20200823 06:52:59
damn missed AC bc of a f***ing colon. Be careful with the syntax and indentation in o/p 

abhay_prakash:
20200725 13:29:11
Since everybody is writing, I must also write "AC in one go...". 

pavan_putra:
20200605 12:51:28
Its very easy but check ur output format. Capitals for each output word...like impossible :) 

hritik_1105:
20200516 13:49:14
It's an easy problem all you've to do it is just sort the array and after sorting make the array elements as the sum of all the previous elements then you can apply binary search or simple traversing.


manish_thakur:
20191210 06:47:19
easy using priority queue, ac in one go 

schnaggrwl:
20191028 18:53:20
The ouput format includes a blank line after every output.


srtpatil_2000:
20191021 08:34:59
its two blank lines after each output 
Added by:  Daniel Gómez Didier 
Date:  20081117 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO 
Resource:  2007  Circuito de Maratones ACIS / REDIS 