本文共 1012 字，大约阅读时间需要 3 分钟。

7-7 L-Flowers

Each bunch of flowers must have exactly M flowers. As Jack does not want to be boring, he hopes that flowers in the same bunch are all different species. Now there are N species of flowers in the flower shop, and the number of the i-th species of flower is a​i. Now Jack would like to know how many bunches of flowers he can prepare at most.

(Flowers are used to propose.)

Sample Output

#include
   
    using namespace std;typedef long long ll;const int maxn=3e5+1; int T,n;ll k,a[maxn];bool check(ll x){   	ll sum=0;	for(int i=1;i<=n;++i) sum+=min(a[i],x);	return sum>=x*k;}int main(){   	scanf("%d",&T);	while(T--)	{   		ll sum=0;		scanf("%d %lld",&n,&k);		for(int i=1;i<=n;++i) scanf("%lld",&a[i]),sum+=a[i]; 		ll l=0,r=sum,mid;		while(l<=r)		{   			mid=(l+r)>>1;			if(check(mid)) l=mid+1;			else r=mid-1;		}		printf("%lld\n",r);	} }
   

转载地址：http://thewz.baihongyu.com/