题解 | 华华给月月准备礼物

#include<bits/stdc++.h>
#define int long long

using namespace std;

const int N=2e5+5;

int n,k;
int l[N];

inline int work(int x)
{
    int res=0;
    for(int i=1;i<=n;i++) res+=l[i]/x;
    return res;
}

signed main()
{
    scanf("%lld%lld",&n,&k);
    int maxn=-1;
    for(int i=1;i<=n;i++) scanf("%lld",&l[i]),maxn=max(maxn,l[i]);
    int L=1,R=maxn;
    while(L<=R)
    {
        int mid=(L+R)/2;
        int tmp=work(mid);
        if(tmp<k) R=mid-1;
        else L=mid+1;
    }
    printf("%lld",R);
    return 0;
}