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
jumaruba:
20190707 13:02:41
It's not needed a new line 

anand_undavia:
20190610 18:43:43
Java => I used Integer[] and I got TLE. I used int[] and got AC! 

yogesh1208:
20190527 22:52:19
this question is really pathetic never forget to print extra line after every test case it cost me 2 wa 

aj_254:
20190501 12:36:23
ac in two go #1: costed me a wa


:
20190322 06:59:41
AC In one go... 

sarthak_1998:
20190321 19:54:39
Last edit: 20190520 12:50:22 

sandy7jr:
20190316 08:27:15
@aditya , algorithm might be right , check out your output format 

sandy7jr:
20190316 08:25:59
Write sorting algorithm from scratch


aditya81070:
20190302 05:36:54
My code is running correctly. This question has simple logic but spoj is giving WA every time.


phoenix0o0:
20181221 16:09:29
Watch out for the output format. Last edit: 20181221 16:10:24 
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 