CodeForces - 812C Sagheer and Nubian Market 二分
On his trip to Luxor and Aswan, Sagheer went to a Nubian market to buy some souvenirs for his friends and relatives. The market has some strange rules. It contains n different items numbered from 1 to n. The i-th item has base cost aiEgyptian pounds. If Sagheer buys k items with indices x1, x2, ..., xk, then the cost of item xj is axj + xj·k for 1 ≤ j ≤ k. In other words, the cost of an item is equal to its base cost in addition to its index multiplied by the factor k.
Sagheer wants to buy as many souvenirs as possible without paying more than SEgyptian pounds. Note that he cannot buy a souvenir more than once. If there are many ways to maximize the number of souvenirs, he will choose the way that will minimize the total cost. Can you help him with this task?
Input
The first line contains two integers n and S (1 ≤ n ≤ 105 and 1 ≤ S ≤ 109) — the number of souvenirs in the market and Sagheer's budget.
The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 105) — the base costs of the souvenirs.
Output
On a single line, print two integers k, T — the maximum number of souvenirs Sagheer can buy and the minimum total cost to buy these k souvenirs.
Example
3 11
2 3 5
2 11
4 100
1 2 5 6
4 54
1 7
7
0 0
Note
In the first example, he cannot take the three items because they will cost him [5, 9, 14] with total cost 28. If he decides to take only two items, then the costs will be [4, 7, 11]. So he can afford the first and second items.
In the second example, he can buy all items as they will cost him [5, 10, 17, 22].
In the third example, there is only one souvenir in the market which will cost him 8pounds, so he cannot buy it.
最新文章
- PHP 通过Socket收发16进制数据
- linux journel
- C++ _access和_waccess的使用方法
- ubuntu下为opera26.0安装flash
- 如何由XSD自动生成XML和实体类
- Centos6.4在配置Tomcat7工作文件夹和虚拟路径
- JavaSE学习总结第04天_Java基础语法3
- Qt分析:Qt中的两种定时器(可是QObject为什么要提高定时器呢,没必要啊。。。)
- android代码控制seekbar的样式
- 在 Linux 系统中安装Load Generator ,并在windows 调用方法
- js修改样式表规则
- 多线程 Synchronized关键字和Lock
- LOJ #6031 字符串
- FeignClient注解及参数
- Java基础14-缓冲区字节流;File类
- PythonStudy——nonlocal关键字
- VGG-16详解
- python环境与PyDev IDE配置
- Random库 --Python3
- devexpress gridview 添加按钮