using namespace std;
int n, k, a[100005], max_a=-1;
int check(int kk){
int   ret=0
for(int j=0; j<n; i++)
ret+=a[i]/kk
return ret
}
int main()
{
cin>>n>>k;
for(int i=0; i<n; i++)
cin>>a[i], max_a=max(max_a,a[i]);
int l=1, r=max_a
int ans=0;
while(l<=r){
int mid=(l+r)/2
if(check(mid)>=k){
ans=mid;
l=mid+1;
}
else
r=mid-1;
}
cout<<ans;
return 0;
}

#include<bits/stdc++.h>
using namespace std;
int n, k, a[100005], max_a=-1;
int check(int kk){
    int   ret=0;
    for(int i=0; i<n; i++)
        ret+=a[i]/kk;
    return ret;
}
int main()
{
    cin>>n>>k;
    for(int i=0; i<n; i++)
        cin>>a[i], max_a=max(max_a,a[i]);
    int l=1, r=max_a;  //搜索范围是[1,max_a]
    int ans=0;  //初始化假定无解为0
    while(l<=r){
        int mid=(l+r)/2;
        if(check(mid)>=k){    //如果以mid长度切木头获得的段数>=k,则说明ans偏小
            ans=mid;
            l=mid+1;
        }
        else
            r=mid-1;
    }
    cout<<ans;
    return 0;
 }

''' a a