AcWing 1227. 分巧克力
原题链接
简单
作者:
pakchoiii
,
2021-01-15 11:20:35
,
所有人可见
,
阅读 426
C++ 代码
#include<iostream>
using namespace std;
const int N = 100010;
int h[N], w[N], n, k;
bool check(int mid) {
int sum = 0;
for (int i = 0; i < n; i++) {
sum += (h[i] / mid) * (w[i] / mid);
if (sum >= k)return true;
}
return false;
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i] >> w[i];
}
int l = 1, r = 1e5;
while (l < r) {
int mid = l + r + 1 >> 1;
if (check(mid))l = mid;
else r = mid - 1;
}
cout << r << endl;
return 0;
}