#2，#7,#8TLE，求大佬看看代码！

#include <bits/stdc++.h>
using namespace std;

long long n, k, l[200101], maxn = 0;
long long sum = 0;

inline long long cut(long long len){
	long long s = 0;
	for (int i = 1; i <= n; i++) s += l[i]/len;
	return s;
}

int main(){
	cin >> n >> k;
	for (int i = 1; i <= n; i++){
		cin >> l[i];
		sum += l[i];
		maxn = max(maxn, l[i]);
	}
	if (sum < k){
		printf("0");
		return 0;
	}
	long long r = min(sum/k, maxn);
	long long l = 1;
	while (l != r){
		long long mid = (l + r) >> 1;
		if (cut(mid) >= k) l = mid;
		if (cut(mid) < k) r = mid - 1;
	}
	printf("%lld", l);
	return 0;
}