WA48分求调

#include<iostream>
using namespace std;
int n,k,a[100005],l=0x3f3f3f3f,r,ans;
bool f(int x){
    int s=0;
    for(int i=1;i<=n;i++){
        s+=a[i]/x;
    }
    return (s>=k);
}
int main(){
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        l=min(l,a[i]);
        r=max(r,a[i]);
    }
    while(l<=r){
        int mid=(l+r)/2;
        if(f(mid)){
            ans=mid;
            l=mid+1;
        }else r=mid-1;
    }
    cout<<ans;
    return 0;
}