有一个点RE了!!!
查看原帖
有一个点RE了!!!
742157
ZYK_luogu楼主2023/5/1 16:10
#include <iostream>
using namespace std;
#define maxn 100005
#define INF 1e16

long long n, k;
long long a[maxn];

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

int main() {
	cin >> n >> k;
	for(int i = 0; i < n; i ++) 
		cin >> a[i];
	long long L = 0, R = INF, mid = L + R >> 1, ans = mid;
	while(L <= R) {
		mid = L + R >> 1;
		if(check(mid))
			L = mid + 1, ans = mid;
		else
			R = mid;
	}
	cout << ans;
	return 0;
}

2023/5/1 16:10
加载中...