(2022 Niu Ke Duo School 5) B-Watches (two points)

Title:

Sample input:

4 53 4 5 6

Sample output:

1

The meaning of the question: Given the price of n items, if you buy the k-th item, then the cost of purchasing the i-th item is ai+k*i, ask how many items m yuan can buy at most (the ith itemis the ith in the original sequence)

Analysis: One thing we can easily find is that The answer is monotonic, if I can buy k items, then I mustCan buy k-1 items, this is obvious, so we can sort the items, for every two-point k we need according to ai+k*i is sorted from small to large, and then you can greedily select from front to back to see how many items can be bought with m yuan at most, if it is greater than k, return true, otherwise return false.

Here is the code:

#include#include#include#include#include