AcWing 1227. 分巧克力
原题链接
简单
作者:
sy123
,
2021-01-15 23:27:15
,
所有人可见
,
阅读 333
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef pair<int, int>PII;
const int N = 100010;
int n, k;
PII w[N];
bool check(int mid)
{
int cnt = 0;
for (int i = 0; i < n; i ++ )
cnt += (w[i].x / mid)*(w[i].y / mid);
return cnt >= k;
}
int main()
{
cin >> n >> k;
for (int i = 0; i <n; i ++ ) cin >> w[i].x >> w[i].y;
int l = 1, r = 1e5+10;
while (l<r)
{
int mid = (l + r + 1) / 2;
if (check(mid)) l = mid;
else r = mid - 1;
}
printf("%d\n", l);
return 0;
}