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). InputThe 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. OutputIf 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.
解法一见【这里】。
维护当前最大的k个橘子,每次取出最大的橘子,如果分完的两块都比最小的橘子大,就分之后更新,否则不用再分了。
具体做法上,因为最大橘子只减不增,最小橘子只增不减【否则就没有必要切了】,可以开一个数组维护橘子个数,维护两个指针表示最大橘子和最小橘子,再维护当前总共有多少个橘子。复杂度O(10^7)。
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define LL long long
const int oo=0x3f3f3f3f;
int rd()
{
int x=0;
char c=getchar();
while (c<'0'||c>'9') c=getchar();
while (c>='0'&&c<='9')
{
x=x*10+c-'0';
c=getchar();
}
return x;
}
int n,k;
LL a[10000010];
int main()
{
LL s=0,p;
int i,j=oo,x,y;
n=rd();
k=rd();
for (i=1;i<=n;i++)
x=rd(),a[x]++,s+=x,j=min(j,x);
if (s<k)
{
printf("-1\n");
return 0;
}
i=1e7;
while (!a[i]) i--;
p=n;
while (p<k)
{
a[i/2]+=a[i];
a[i-i/2]+=a[i];
p+=a[i];
j=min(j,i/2);
i--;
while (!a[i]) i--;
}
while (p-a[j]>=k)
{
p-=a[j++];
while (!a[j]) j++;
}
while (1)
{
x=i/2;
y=i-x;
if (x>j)
{
a[x]+=a[i];
a[y]+=a[i];
p+=a[i];
while (p-a[j]>=k)
{
p-=a[j++];
while (!a[j]) j++;
}
}
else break;
i--;
while (!a[i]) i--;
}
printf("%d\n",j);
}