PID-4769-Animals
来源:互联网 发布:淘宝复核阿里钱盾 编辑:程序博客网 时间:2024/05/22 18:22
C. Animals
Once upon a time DravDe, an outstanding person famous for his professional achievements (as you must remember, he works in a warehouse storing Ogudar-Olok, a magical but non-alcoholic drink) came home after a hard day. That day he had to drink 9875 boxes of the drink and, having come home, he went to bed at once.
DravDe dreamt about managing a successful farm. He dreamt that every day one animal came to him and asked him to let it settle there. However, DravDe, being unimaginably kind, could send the animal away and it went, rejected. There were exactly n days in DravDe’s dream and the animal that came on the i-th day, ate exactly ci tons of food daily starting from day i. But if one day the animal could not get the food it needed, it got really sad. At the very beginning of the dream there were exactly X tons of food on the farm.
DravDe woke up terrified...
When he retold the dream to you, he couldn’t remember how many animals were on the farm by the end of the n-th day any more, but he did remember that nobody got sad (as it was a happy farm) and that there was the maximum possible amount of the animals. That’s the number he wants you to find out.
It should be noticed that the animals arrived in the morning and DravDe only started to feed them in the afternoon, so that if an animal willing to join them is rejected, it can’t eat any farm food. But if the animal does join the farm, it eats daily from that day to then-th.
Input
The first input line contains integers n and X (1 ≤ n ≤ 100, 1 ≤ X ≤ 104) — amount of days in DravDe’s dream and the total amount of food (in tons) that was there initially. The second line contains integers ci (1 ≤ ci ≤ 300). Numbers in the second line are divided by a space.
Output
Output the only number — the maximum possible amount of animals on the farm by the end of the n-th day given that the food was enough for everybody.
Sample Input
3 4
1 1 1
2
3 6
1 1 1
3
//题意为一个人要养几天动物,他有多少饲料,每天动物都会来一只,对应的数为它每天的食量。
//一开始会想着用01背包后来直接想根本不用只需要找出那些吃的最少的就行了,算是贪心吧。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){ int n,m; while(~scanf("%d%d",&n,&m)) { int i,j,a[105],eat,sum=0; for(i=0;i<n;i++) { scanf("%d",&eat); a[i]=eat*(n-i); } sort(a,a+n); for(i=0;i<n;i++) { if(m-a[i]>=0) { sum++; m=m-a[i]; } if(m==0) { break; } if(m<0) { sum--; break; } } printf("%d\n",sum); }}
- PID-4769-Animals
- Animals
- ubuntu animals
- D - Animals
- C. Animals
- Guangzhou Welcomes Animals
- woj 1005 Holding Animals
- woj1005 - Holding Animals
- woj1006-Language of Animals
- woj1007- Feeding Animals(I)
- 1602 - Lattice Animals
- UVa 1602 Lattice Animals
- UVa1602 - Lattice Animals
- 1602 - Lattice Animals
- WOJ1005 - Holding Animals
- WOJ1006 - Language of Animals
- UVA 1062 Lattice Animals
- protect the other animals
- Android 首个Activity启动动画设置
- JavaScript计时器
- 修改Python IDLE代码配色及语法高亮主题
- C++算法从入门到放弃-无向图(1)
- 设备管理信息系统
- PID-4769-Animals
- hex2bin
- 下拉框多选
- 【NOIP模拟】有趣的有趣的家庭菜园
- 人脸识别face++ SDK demo体验
- 用到二分搜索的抽签问题
- 对Python、shell的一些思考
- 项目名称:上海地铁游
- 第六周项目28-用多文件组织多个类的程序(带武器的角色类)