POJ 2487 Stamps
2015-10-26 19:41
295 查看
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
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 <stdio.h> #include <stdlib.h> #include <string.h> #include <iostream> #include <algorithm> using namespace std; int main(){ int n; int Case=1; scanf("%d",&n); while(n--){ int x,y; scanf("%d %d",&x,&y); int i; int arr[1010]; for(i=0;i<y;i++){ scanf("%d",&arr[i]); } sort(arr,arr+y); int sum=0; for(i=y-1;i>=0;i--){ sum=sum+arr[i]; if(sum>=x){ break; } } printf("Scenario #%d:\n",Case++); if(sum>=x) printf("%d\n",y-i); else printf("impossible\n"); if(n) putchar(10); } return 0; }
相关文章推荐
- iOS 分享(使用友盟sdk)
- java学习一目了然——File类文件处理
- C++中int *p[4]和 int (*q)[4]的区别
- oracle课堂收录-函数举例
- asp.net 中把txt文件导入 vs2010的sql2008数据库的一张表中【已测试,可以实现】
- iOS target
- 音频编码之opus(一)
- NavigationItem的Title不居中,BackButton修改它得title
- UNIX Tutorial for Beginners
- Android JNI实现计算器demo
- Android JNI实现计算器demo
- Android JNI实现计算器demo
- BugPhobia开发篇章:Scurm Meeting-更新至0x03
- iOS富文本(一)属性化字符串
- iOS富文本(一)属性化字符串
- BugPhobia开发篇章:Scurm Meeting-更新至0x03
- Android ListView适配器BaseAdapter
- Hihocoder #1095 : HIHO Drinking Game (微软笔试题)
- android部分目录分析
- 设置hyperlinkbutton参数