P8582 - Watches

内存限制：256 MB 时间限制：1 S

题面：传统评测方式：文本比较上传者：

提交：1 通过：1

NIO is the boss of the watch shop. One day, he wants to purchase a batch of watches from the manufactory. However, he lives in Amefica(not a real country), a country in is heavily taxed. If he buys

watches, the

i

-th (starts from 1) watch in his list will cost him

a_{i}

(the original price) plus

k \times i

dollars (the

i

-th one in the original list) . Now NIO only has

M

dollars, so NIO asks you how many watches he can purchase actually.

The first line contains two integers

, denoting the number of watches he would like to buy and the amount of money NIO has, respectively. The second line contains

integers,

a_{i}

represents that the price of the

i

-th watch in the list.

Output a number, representing the maximum number of watches that NIO can purchase.

4 5
3 4 5 6

"蔚来杯"2022牛客暑期多校训练营5

8582: Watches

题目描述

输入格式

输出格式

输入样例复制

输出样例复制

分类标签