CF - 812C. Sagheer and Nubian Market - 暴力+排序贪心+二分

1.题目描述：

C. Sagheer and Nubian Market

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard 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 kitems 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 ksouvenirs.

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.

2.题意概述：

看了很久才看明白，题意描述有点迷。。

大致意思就是有n件商品，其中第i件，原价是a[i]，这个商店老板很怪，你如果买它k件商品，假设这k件商品的id是x1, x2, ..., xk，那么这k件商品每件的实际价格是axj + xj·k

，某人只有S元钱，问你他最多可以买几件商品，它们的总和是多少？

3.解题思路：

对于每一个确定的k，每件商品的价格其实已经是确定了的，总和也确定了的就是，我们可以考虑二分k的值，然后确定了k的值，每件商品价格就是axj + xj·k，再去排序，贪心地选择最小价格的就行。复杂度是

ps：本来想想这么高的复杂度不敢试的，结果看到限制时间2s决定试一发，居然A了。。。赛后看官方Tutorial居然真是这样的复杂度Orz。。。其实很想知道能不能优化啊T_T

4.AC代码：

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define maxn 100010
#define lson root << 1
#define rson root << 1 | 1
#define lent (t[root].r - t[root].l + 1)
#define lenl (t[lson].r - t[lson].l + 1)
#define lenr (t[rson].r - t[rson].l + 1)
#define N 1111
#define eps 1e-6
#define pi acos(-1.0)
#define e exp(1.0)
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
typedef unsigned long long ull;
struct node
{
	int a, id;
	ll ans;
	friend bool operator< (node x, node y)
	{
		return x.ans < y.ans;
	}
} p[maxn];
ll check(int x, int s, int n)
{
	for (int i = 1; i <= n; i++)
		p[i].ans = p[i].a + 1LL * x * p[i].id;
	sort(p + 1, p + n + 1);
	ll sum = 0;
	for (int i = 1; i <= x; i++)
		sum += p[i].ans;
	return sum;
}
int main()
{
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	long _begin_time = clock();
#endif
	int n, s;
	while (~scanf("%d%d", &n, &s))
	{
		for (int i = 1; i <= n; i++)
		{
			scanf("%d", &p[i].a);
			p[i].id = i;
		}
		int l = 0, r = n, k = 0;
		ll S = 0;
		while (l <= r)
		{
			int mid = l + r >> 1;
			ll res = check(mid, s, n);
			if (res <= s)
			{
				S = res;
				k = mid;
				l = mid + 1;
			}
			else
				r = mid - 1;
		}
		printf("%d %I64d\n", k, S);
	}
#ifndef ONLINE_JUDGE
	long _end_time = clock();
	printf("time = %ld ms.", _end_time - _begin_time);
#endif
	return 0;
}