POJ 2487 Stamps
来源:互联网 发布:提高数据分析能力 编辑:程序博客网 时间:2024/04/30 23:26
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 <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;}
- POJ 2487 Stamps
- POJ 2487 Stamps
- POJ 2487 Stamps G++
- POJ 1010 STAMPS
- poj 1010 STAMPS
- poj 1010 STAMPS
- POJ-1010-STAMPS
- [POJ][1010]STAMPS
- POJ 1010 STAMPS
- POJ - 1010 STAMPS
- POJ 1010: STAMPS
- POJ 1010 STAMPS(DFS)
- POJ 1010 STAMPS
- POJ 1010--STAMPS
- STAMPS POJ 1010
- poj 1010:STAMPS
- POJ 1010 STAMPS 笔记
- POJ 1010--STAMPS
- 打字母游戏3
- 如何不停止服务清空nohup.out文件
- php常用代码大全
- iOS 分享(使用友盟sdk)
- 牛客网 | 数组中出现次数超过一半的数字
- POJ 2487 Stamps
- leetcode 235 Lowest Common Ancestor oa a Binary Search Tree
- FRM-40831错误的解决办法?
- scrollView中设置ImageView大小
- android资源目录---assets与res/raw区别
- Swift学习 下标脚本subscript和类扩展Extension
- 小随记
- Your project contains error(s),please fix them before running your application
- 对java类override的探讨