toj 1701 Stamps

1701.   Stamps
Time Limit: 2.0 Seconds   
Memory Limit: 65536K
Total Runs: 3159   
Accepted Runs: 1053   
Multiple test files
Background
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.
Problem
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'd 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 is 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.
Sample Input

3
100 6
13 17 42 9 23 57
99 6
13 17 42 9 23 57
1000 3
314 159 265

 
 
Sample Output

Scenario #1:
3
Scenario #2:
2
Scenario #3:
impossible

 
 
Source: TUD Programming Contest 2005
 
Submit   List    Runs   Forum   Statistics
 
//
639092 2009-05-16 12:40:02 A C++ 0.6K 0'00.05" 1212K forever4444 
#include 
<
iostream
>
#define
 MAX 1002
#include 
<
algorithm
>
using
 
namespace
 std;
bool
 comp(
int
 a,
int
 b) {     
return
 a
>
b; }
int
 t,n;
int
 data[MAX];
int
 main() {     
int
 i,sum;     
int
 zz
=
1
;     cin
>>
t;     
while
(t
--
)     {         scanf(
"
%d%d
"
,
&
sum,
&
n);         
for
(i
=
0
;i
<
n;i
++
)             scanf(
"
%d
"
,
&
data[i]);         sort(data
+
0
,data
+
n,comp);         
bool
 mark
=
false
;         printf(
"
Scenario #%d:
"
,zz
++
);         
for
(i
=
0
;i
<
n;i
++
)         {             sum
=
sum
-
data[i];             
if
(sum
<=
0
)             {                 printf(
"
%d
"
,i
+
1
);                 mark
=
true
;                 
break
;             }         }         
if
(
!
mark)         {             printf(
"
impossible
"
);         }     }     
return
 
0
; }
 
転載先:https://www.cnblogs.com/forever4444/archive/2009/05/16/1458411.html