WA in #4

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

int n, k, a[100000005];

bool check(int mid){
	int sum = 0;
	for (int i = 0; i < n; i++)
		sum += a[i] / mid;
	return sum >= k;
}

int main(){
	cin >> n >> k;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	sort(a, a + n);
	int l = 1, r = a[n - 1];
	int mid, ans;
	while (l <= r){
		mid = (r + l) / 2;
		if (check(mid))
			l = mid + 1, ans = mid;
		else
			r = mid - 1;
	}
	cout << ans;
	return 0;
}