#include <iostream>
#include <algorithm>
using namespace std;
long long arr[100000001];
long long n, k;
int main() {
	cin >> n >> k;
	for (long long i = 1; i <= n; i++) {
		cin >> arr[i];
	}
	sort(arr + 1, arr + n + 1);
	
	long long left = arr[0], right = arr[n];

	while (left <= right) {
		long long mid = (left + right) >> 1;
		long long ans = 0;
		for (long long i = 1; i <= n; i++) {
			long long tmp = arr[i];
			if (tmp >= mid) ans += (tmp /= mid);
		}
		if (ans >= k) left = mid + 1;
		else right = mid - 1;
	}
	cout << right;
	return 0;
}

请大佬们看看为什么会在第四个测试点RE