#include <bits/stdc++.h>
using namespace std;
int L, n, k, a[1000010];
int check(int d) {
	int cnt = 0;
	for (int i = 1; i <= n; i++) {
		cnt += a[i] / d;
	}
	return cnt >= k;
}
int main() {
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= n; i++)scanf("%d", &a[i]);
	int l = 0, r = 1e8, mid, ans = 0;
    for(int i=0;i<100;i++) 
    {
        int mid = (l + r) / 2;
        if (check(mid)) l = mid;
        else r = mid;
    }
  
	printf("%d", l);
	return 0;
}