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).
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.
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.
3 2 5 9 3
5
2 4 12 14
6
2 3 1 1
-1
In the first example Santa should divide the second tangerine into two parts with 5 and 4 slices. After that he can present the part with 5slices to the first pupil and the whole first tangerine (with 5 slices, too) to the second pupil.
In the second example Santa should divide both tangerines, so that he'll be able to present two parts with 6 slices and two parts with 7slices.
In the third example Santa Claus can't present 2 slices to 3 pupils in such a way that everyone will have anything.
题意 有n个数分给m个人
每个数可以分成两个新的数 i/ 2 (i+1)/2 分后的数可以继续分 但不允许分1=1+0
最后分给每个人,求分得的数最小的人分得的数是多少
直接枚举答案
当枚举到i时,cnt[i拆成的两个数]+=cnt[i],统计答案时减去父亲的贡献即可
注意减的是i*2-1的贡献,但i=1时要特判
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000000;
int a[maxn + 1], n, m, mx;
long long cnt[maxn * 10 + 1], cur;
int main()
{
scanf( "%d%d", &n, &m );
for( int i = 1 ; i <= n ; i++ ) scanf( "%d", &a[ i ] ), cur += a[ i ], cnt[ a[ i ] ]++, mx = max( mx, a[ i ] );
if( cur < m ) return puts( "-1" ), 0;
cur = 0;
for( int i = mx ; i ; i-- )
{
cur += cnt[ i ];
if( i * 2 <= mx ) cur -= cnt[ i << 1 ];
if( i * 2 - 1 <= mx && i != 1 ) cur -= cnt[ i * 2 - 1 ];
if( cur >= m ) return printf( "%d\n", i ), 0;
cnt[ i >> 1 ] += cnt[ i ];
cnt[ i + 1 >> 1 ] += cnt[ i ];
}
}