#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(a,b) for(int i=(a);i<=(b);i++)

/*n根木头，k段，求max每段长度*/
int n,k,s[100005],l=0,r,mid,t,ans,pd;

signed main(){
	cin>>n>>k;
	f(1,n){cin>>s[i];pd+=s[i];r=max(s[i],r);};
	if(pd<k) {cout<<"0"<<endl;return 0;}
	while(l<=r){
		mid=(l+r)/2;
		t=0;
		f(1,n) t+=s[i]/mid;
		if(t==k) ans=max(ans,mid);
		if(t>=k) l=mid+1;
		else r=mid-1; 
	}
	
	cout<<ans<<endl;
	
	return 0;
}

WA记录