AcWing 1227. 分巧克力
原题链接
简单
作者:
Conan15
,
2021-12-26 11:09:04
,
所有人可见
,
阅读 257
#include <bits/stdc++.h>
using namespace std;
int x[100010], y[100010];
int n, k;
int check(int s) {
int num = 0;
for (int i = 0;i < n; i++) {
num += (x[i] / s) * (y[i] / s);
if (num >= k) return 1;
}
return 0;
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) scanf("%d%d", &x[i], &y[i]);
int l = 1, r = 100000;
while (l < r) {
int mid = l + r + 1 >> 1;
if (check(mid)) l = mid;
else r = mid - 1;
}
printf("%d", l);
}