#include<bits/stdc++.h>
using namespace std;
long long n,m,a[1000010],ans;
bool check(long long x)
{
	long long ans=0;
	for (int i=1;i<=n;i++)
		ans+=a[i]/x;
	return ans>=m;
}
int main()
{
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=n;i++)
	    scanf("%lld",&a[i]);
	sort(a+1,a+n+1);
	int l=0,r=100000001;
	while(l<=r)
	{
		int mid=(l+r)/2;
		if(check(mid))
		    l=mid+1;
		else
		    r=mid-1;
	}
	printf("%d",r);
	return 0;
}

88分......劳烦各位大佬帮忙看看是不是细节问题