#include<bits/stdc++.h>
using namespace std;
int n,k,j,l,r,mid,daan;
long long sum;
map<long long,int>a;
bool xin(int x)
{
	int sun=0;
	for(int i=1;i<=n;i++)
	{
		sun+=a[i]/x;
	}
	if(sun>=k) return true;
	return false;
}
int main()
{
	cin>>n>>k;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		sum+=a[i];
	}
	if(sum<k)
	{
		cout<<"0";
		return 0;
	}
	sum/=k;
	r=sum;
	while(l<=r)
	{
		mid=l+(r-l)/2;
		if(xin(mid)) 
		{
			l=mid+1;
			daan=mid;
		}
		else r=mid-1;
	}
	cout<<daan;
	return 0;
}