codeforces 507A Amr and Music
来源:互联网 发布:php 图片上传插件 编辑:程序博客网 时间:2024/05/21 07:05
点击打开链接
Amr is a young coder who likes music a lot. He always wanted to learn how to play music but he was busy coding so he got an idea.
Amr has n instruments, it takes ai days to learn i-th instrument. Being busy, Amr dedicated k days to learn how to play the maximum possible number of instruments.
Amr asked for your help to distribute his free days between instruments so that he can achieve his goal.
The first line contains two numbers n, k (1 ≤ n ≤ 100, 0 ≤ k ≤ 10 000), the number of instruments and number of days respectively.
The second line contains n integers ai (1 ≤ ai ≤ 100), representing number of days required to learn the i-th instrument.
In the first line output one integer m representing the maximum number of instruments Amr can learn.
In the second line output m space-separated integers: the indices of instruments to be learnt. You may output indices in any order.
if there are multiple optimal solutions output any. It is not necessary to use all days for studying.
4 104 3 1 2
41 2 3 4
5 64 3 1 1 2
31 3 4
1 34
0
In the first test Amr can learn all 4 instruments.
In the second test other possible solutions are: {2, 3, 5} or {3, 4, 5}.
In the third test Amr doesn't have enough time to learn the only presented instrument.
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;struct node{ int x,y;} a[110];int comp(node x,node y){ return x.x<y.x;}int main(){ int n,k,b[110],w=0; scanf("%d%d",&n,&k); for(int i=0; i<n; i++) { scanf("%d",&a[i].x); a[i].y=i; } sort(a,a+n,comp); for(int i=0;i<n;i++) { if(k>=a[i].x) { k-=a[i].x; b[w++]=a[i].y; } } printf("%d\n",w); for(int j=0;j<w;j++) { if(j==0) printf("%d",b[j]+1); else printf(" %d",b[j]+1); } if(w) printf("\n"); return 0;}
- Codeforces 507A Amr and Music
- CodeForces 507A Amr and Music
- codeforces 507A Amr and Music
- codeforces--507A--A. Amr and Music--507B--B. Amr and Pins
- A. Amr and Music
- A. Amr and Music
- A Amr and Music( Codeforces Round #287 (Div. 2))
- Codeforces Round #287 (Div. 2) A. Amr and Music
- coderforce 507A Amr and Music(贪心)
- Amr and Music
- Amr and Music
- codeforces-#287-- 507B Amr and Pins
- Codeforces-507B-Amr and Pins
- Codeforces 507B Amr and Pins【思维】
- Codeforces 569A Music
- codeforces 569A Music
- CodeForces 569A-Music
- Codeforces 569 A Music
- 算法题练习系列之(二十二): 旧键盘
- LINUX编程学习路线
- 1.5 递归算法
- Spring boot添加shiro时,添加EhCacheManager出错
- Java并发编程:CountDownLatch
- codeforces 507A Amr and Music
- 数据库可编程性;存储过程;函数;触发器
- 设计模式-迭代器模式
- <a>标签来响应onclick事件
- MSP430直流电机控制
- 服务器与客户端简单通信 ——server
- thinkphp几个常用的字母方法
- 用scrapy框架爬取豆瓣Top250电影
- 语句快的层次