GYM 100883 C.Too Many Coins(水~)
来源:互联网 发布:sony 刷机软件 编辑:程序博客网 时间:2024/06/10 12:26
Description
n枚硬币,现在可以带其中某些面值的硬币,使得带的硬币总面值不小于m,问最少要带多种硬币
Input
第一行一整数T表示用例组数,每组用例首先输入两个整数n和m表示硬币数和需要的面值,之后n个整数a[i]表示每枚硬币的面值(1<=n,a[i]<=1e6,1<=m<=1e9)
Output
如果所有硬币带上都不够m则输出Impossible,否则输出种类最少的情况,如果有多组解则输出面值相对大的那个
Sample Input
3
10 7
1 1 1 1 1 2 2 2 5 4
10 11
1 1 1 1 1 1 1 1 1 1
10 6
1 1 1 1 1 1 2 2 2 3
Sample Output
2 5
Impossible
2
Solution
统计每种面值的硬币的单个面值和总面值,之后对总面值排序,先用总面值大的那种硬币
Code
#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<cmath>#include<vector>#include<queue>#include<map>#include<set>#include<ctime>using namespace std;typedef long long ll;#define INF 0x3f3f3f3f#define maxn 1111111int T,n,m,a[maxn],res,cnt;struct node{ ll v; int id; node(){}; node(ll _v,int _id) { v=_v,id=_id; } bool operator<(const node&b)const { if(v!=b.v)return v>b.v; return id>b.id; }}b[maxn];int main(){ scanf("%d",&T); while(T--) { scanf("%d%d",&n,&m); ll sum=0; memset(a,0,sizeof(a)); while(n--) { int temp; scanf("%d",&temp); sum+=1ll*temp,a[temp]++; } if(sum<m)printf("Impossible\n"); else { res=0; for(int i=1;i<=1000000;i++) if(a[i])b[res++]=node(1ll*i*a[i],i); sort(b,b+res); sum=0;cnt=0; for(int i=0;i<res;i++) { a[cnt++]=b[i].id; sum+=b[i].v; if(sum>=m)break; } sort(a,a+cnt); for(int i=0;i<cnt;i++)printf("%d%c",a[i],i==cnt-1?'\n':' '); } } return 0;}
0 0
- GYM 100883 C.Too Many Coins(水~)
- GYM 100712 G.Heavy Coins(枚举)
- GYM 101102 A.Coins(01背包)
- MySQL连接太多(too many connections)
- GYM 100971 C.Triangles(水~)
- Loadrunner报错“Too many local variablesAction.c”解决方法
- Gym-100712G-Heavy Coins
- Gym 100712G Heavy Coins
- Too many connections
- too many open files
- too many open files
- mysql: Too many connections
- too many unprocessed floats
- too many unprocessed floats
- Too many open files
- Too many input arguments.
- mina too many files
- too many open files
- 如何运行Struts2官网最新Demo-
- 数据压缩:yuv2rgb并通过rgb2yuv进行验证
- Java Socket编程----通信是这样炼成的
- Nginx下出现Access denied (403) see security.limit_extensions错误的解决方法
- 为什么pageHelper超过最大页数后还会返回数据
- GYM 100883 C.Too Many Coins(水~)
- windows下Gradle安装
- oracle中的递归查询
- 前端学HTTP之客户端识别和cookie
- 【第十一课】异常---异常与继承
- VC维的来龙去脉
- [读书笔记] 蔡康永的说话之道
- 如何在电脑上调试手机上显示的网页
- java api操作hive遇到的问题