为啥第六个点WA了

#include<bits/stdc++.h>
using namespace std;
const int N=5000100;
int a[N],n,k,sum,Maxn=-1;
bool pd;
bool check(int mid)
{
    int s=0;
    for(int i=1;i<=n;i++)
        s+=a[i]/mid;
    if(s>=k)
    {
        pd=true;
        return 1;
    }
    return 0;
}
int find(int k)
{
    int l=1,r=Maxn;
    while(l<r)
    {
        int mid=l+r+1>>1;
        if(check(mid))l=mid;
        else r=mid-1;
    }
    if(pd)return l;
    return 0;
}
int main()
{
    cin>>n>>k;
    for(int i=1;i<=n;i++)cin>>a[i],Maxn=max(Maxn,a[i]);
    cout<<find(k)<<endl;
    return 0;
}