CF35D.Animals

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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 nn days in DravDe’s dream and the animal that came on the ii -th day, ate exactly cic_{i} tons of food daily starting from day ii . 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 XX 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 nn -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 the nn -th.

输入格式

The first input line contains integers nn and XX ( 1<=n<=100,1<=X<=1041<=n<=100,1<=X<=10^{4} ) — amount of days in DravDe’s dream and the total amount of food (in tons) that was there initially. The second line contains integers cic_{i} ( 1<=ci<=3001<=c_{i}<=300 ). Numbers in the second line are divided by a space.

输出格式

Output the only number — the maximum possible amount of animals on the farm by the end of the nn -th day given that the food was enough for everybody.

输入输出样例

  • 输入#1

    3 4
    1 1 1
    

    输出#1

    2
    
  • 输入#2

    3 6
    1 1 1
    

    输出#2

    3
    

说明/提示

Note to the first example: DravDe leaves the second and the third animal on the farm. The second animal will eat one ton of food on the second day and one ton on the third day. The third animal will eat one ton of food on the third day.

首页