p2440
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
typedef long long ll;
ll n,k,a[N],ans;
ll find(ll l,ll r)
{
	while(l<=r)
	{
		ll mid=(l+r)/2,num=0;
		for(ll i=0;i<n;i++)
		num+=a[i]/mid;
		if(num<k)
		r=mid-1;
		else
		l=mid+1;
	}
	return r;
}
void solve() 
{
	cin>>n>>k;
	for(ll i=0;i<n;i++)
	  cin>>a[i];
	sort(a,a+n);
	ll l=1,r=a[n-1];
	ans=find(l,r);
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL),cout.tie(NULL);
	int T=1;
	while(T--)
	{
		solve();
	}
	return 0;
}