Codeforces Round #389 (Div. 2)：Santa Claus and Tangerines（二分+DP）

E. Santa Claus and Tangerines

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Santa Claus has n tangerines, and the i-th of them consists of exactly ai slices. Santa Claus came to a school which has k pupils. Santa decided to treat them with tangerines.

However, there can be too few tangerines to present at least one tangerine to each pupil. So Santa decided to divide tangerines into parts so that no one will be offended. In order to do this, he can divide a tangerine or any existing part into two smaller equal parts. If the number of slices in the part he wants to split is odd, then one of the resulting parts will have one slice more than the other. It's forbidden to divide a part consisting of only one slice.

Santa Claus wants to present to everyone either a whole tangerine or exactly one part of it (that also means that everyone must get a positive number of slices). One or several tangerines or their parts may stay with Santa.

Let bi be the number of slices the i-th pupil has in the end. Let Santa's joy be the minimum among all bi's.

Your task is to find the maximum possible joy Santa can have after he treats everyone with tangerines (or their parts).

Input

The first line contains two positive integers n and k (1 ≤ n ≤ 106, 1 ≤ k ≤ 2·109) denoting the number of tangerines and the number of pupils, respectively.

The second line consists of n positive integers a1, a2, ..., an (1 ≤ ai ≤ 107), where ai stands for the number of slices the i-th tangerine consists of.

Output

If there's no way to present a tangerine or a part of tangerine to everyone, print -1. Otherwise, print the maximum possible joy that Santa can have.

Examples

input

3 2
5 9 3

output

5

input

2 4
12 14

output

6

input

2 3
1 1

output

-1

翻译：你有n个数，每一次可以将一个大于1的数拆成两个对半开的数（如果ai是奇数，那么将拆成ai/2和ai/2+1），

问你能不能将这n个数拆成至少k个数，如果能，在满足条件的情况下所有数中最小的那个数最大可以是多少？

http://codeforces.com/contest/752/problem/E

二分+DP，二分答案，每次二分判断当前是否能拆成至少k个数（满足题意），如果能，说明答案>=当前二分

值，如果不能，说明答案<当前二分值

那么如何判断最小值为m时最多能拆成多少个数呢？dp就好，dp[i]表示原本为i的数最多能拆成多少个不小于m

的数，状态转移：dp[i] = max(dp[i/2]+dp[(i+1)/2], 1);

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int dp[10000007], a[1000005];
int main(void)
{
	int i, n, k, A, l, r, m;
	long long cnt;
	scanf("%d%d", &n, &k);
	for(i=1;i<=n;i++)
		scanf("%d", &a[i]);
	A = *max_element(a+1, a+n+1);
	l = -1, r = A;
	while(l<r)
	{
		m = (l+r+1)/2;
		memset(dp, 0, sizeof(dp));
		for(i=m;i<=A;i++)
		{
			dp[i] = dp[i/2]+dp[(i+1)/2];
			dp[i] = max(dp[i], 1);
		}
		cnt = 0;
		for(i=1;i<=n;i++)
			cnt += dp[a[i]];
		if(cnt>=k)
			l = m;
		else
			r = m-1;
	}
	printf("%d\n", l);
	return 0;
}