【Codeforces 812 C. Sagheer and Nubian Market】+ 二分
来源:互联网 发布:快速检索算法 编辑:程序博客网 时间:2024/06/05 19:58
C. Sagheer and Nubian Market
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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 ai Egyptian 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 S Egyptian 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.
Examples
Input
3 11
2 3 5
Output
2 11
Input
4 100
1 2 5 6
Output
4 54
Input
1 7
7
Output
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 8 pounds, so he cannot buy it.
对 k 二分
AC代码:
#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>using namespace std;const int MAX = 1e5 + 10;typedef long long LL;LL a[MAX],n,s,b[MAX],num,cut;int sf(LL m){ for(LL i = 1; i <= n; i++) b[i] = a[i] + i * m; sort(b + 1,b + 1 + n); LL ans = 0; for(LL i = 1; i <= m; i++) ans += b[i]; if(ans <= s){ if(num < m) num = m,cut = ans; return 1; } return 0;}void ef(){ LL l = 1,r = n; while(l <= r){ LL m = (l + r) / 2; if(sf(m)) l = m + 1; else r = m - 1; }}int main(){ LL b; scanf("%lld %lld",&n,&s); for(int i = 1; i <= n; i++) scanf("%lld",&a[i]); num = cut = 0; ef(); printf("%lld %lld\n",num,cut); return 0;}
- Codeforces 812C Sagheer and Nubian Market[二分]
- Codeforces 812C Sagheer and Nubian Market【二分】水题
- codeforces 812 C. Sagheer and Nubian Market(二分答案)
- 【Codeforces 812 C. Sagheer and Nubian Market】+ 二分
- codeforces 812C Sagheer and Nubian Market (二分)
- Codeforces 812C-Sagheer and Nubian Market
- Codeforces 812 C Sagheer and Nubian Market
- Codeforces 812C Sagheer and Nubian Market
- codeforces 812C Sagheer and Nubian Market
- CF# 812 C. Sagheer and Nubian Market(二分)
- codeforces 812C——Sagheer and Nubian Market(二分)
- C. Sagheer and Nubian Market
- Codeforces Round #417 (Div. 2) C. Sagheer and Nubian Market 二分基础入门裸题
- Codeforces Round #417 (Div. 2) C. Sagheer and Nubian Market(二分查找)
- Codeforces Round #417 (Div. 2) C. Sagheer and Nubian Market
- Codeforces Round #417 (Div. 2) C. Sagheer and Nubian Market
- Sagheer and Nubian Market(二分)
- Sagheer and Nubian Market (二分)
- 什么是死锁及死锁的必要条件和解决方法
- boost——windows下VS2013update5编译boost库
- 进程间通信使用消息队列的试验代码与总结
- 第39章 连续时间信号与系统的S域分析
- leetcode 338. Counting Bits
- 【Codeforces 812 C. Sagheer and Nubian Market】+ 二分
- MSSQL:DAO连接数据库
- (一)OpenCV中的GUI特性
- Spark 大数据计算
- 通过终端安装程序sudo apt-get install xxx时出错(上次安装没有正常完成)
- 对包含逗号、引号的CSV字符串的解析函数
- sql
- 数据结构--单链表及静态链表
- report studio直接写sql做报表