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
vishalshrm539:
20170325 23:32:50
AC in one go :) 

Yogesh:
20170221 23:07:11
I was getting timeout for Integer [] arr = new Integer[f];


woolfy_24:
20170218 23:19:57
This problem is frustrating. Don't recommend unless you are pedantic. 

shashank joshi:
20170214 18:56:02
take care of


akhil9093:
20170205 14:32:07
easy problem ...! AC in one go...!


splashishkumar:
20170131 13:22:00
simple....use sorting..no logic..........AC in one go


ayushagg31:
20170126 06:14:46
just ignore it!!!!!!!!1 waste of time 

banneq:
20170106 13:11:07
AC in one go, ez one 

gourav_123:
20161229 21:40:32
damn easy.......... 

scorpion_ajay:
20161229 19:24:20
too easy, you may skip this

Added by:  Daniel Gómez Didier 
Date:  20081117 
Time limit:  0.635s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO 
Resource:  2007  Circuito de Maratones ACIS / REDIS 