poj 2487 Stamps

最新推荐文章于 2017-04-29 22:06:41 发布

weixin_30588675

最新推荐文章于 2017-04-29 22:06:41 发布

阅读量80

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/w0w0/archive/2011/11/22/2258562.html

此博客介绍了如何通过合理分配和利用朋友提供的邮票资源，最小化借用数量，以应对邮票收集者之间的竞争。通过算法解决实际问题，提供了解决方案并展示了解题过程。

Stamps

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 7032		Accepted: 3269

Description

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

#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;

int main()
{
int scen;
int n;
int i,j;
int friends;
int need;
int stamp[1000];
int temp;

    cin>>n;
for(scen=1;scen<=n;scen++)
    {
        cin>>need;
        cin>>friends;
for(j=0;j<friends;j++)
        {
            cin>>stamp[j];
        }
        sort(stamp,stamp+friends,greater<int>());

for(j=0;j<friends;j++)
        {
            need-=stamp[j];
if(need<=0)
            {
                cout<<"Scenario #"<<scen<<":"<<endl;
                cout<<j+1<<endl<<endl;
break;
            }
        }
if(j==friends)
            cout<<"Scenario #"<<scen<<":"<<endl<<"impossible"<<endl<<endl;
    }
return 0;
}