题目: 传送门
思路: 二分答案,写个check函数,对每个mid进行检查可行性,结果再检查能不能切割出k块或以上的 l*l 的巧克力,不能的话,要-1
Code:
#include<iostream>
#include<queue>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<stack>
#include<string>
#include<map>
#include<algorithm>
typedef long long ll;
using namespace std;
int a[100007], b[100007];
int n, k;
int l = 1, r = 0;
int get_nk(int x) {
int sum = 0;
for (int i=1;i<=n;i++) {
sum += (a[i] / x) * (b[i] / x);
}
return sum;
}
int main()
{
//freopen("input2.txt", "r", stdin);
cin>>n>>k;
for (int i=1;i<=n;i++) {
cin>>a[i]>>b[i];
r = max(min(a[i], b[i]), r);
}
while (l < r) {
int mid = (l+r)/2;
if (get_nk(mid) >= k) {
l = mid + 1;
} else if (get_nk(mid) < k){
r = mid;
}
}
if (get_nk(l) < k) {
l--;
}
cout<<l<<endl;
return 0;
}