洛谷
acwing
已知n块巧克力的长宽,分给k个小朋友,使得每个小朋友分到的巧克力尽可能的大
每个小朋友分到的巧克力形状是正方形,边长是整数,大小相同
#include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
#include <sstream>
#include <unordered_map>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <string>
#include <cstring>
#define x first
#define y second
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
typedef pair<int,int> PII;
typedef pair<char,int> PCI;
typedef long long LL;
typedef unsigned long long ULL;
const int N=2e5 + 10 , INF = 0x3f3f3f3f ,mod =1e6 + 7;
int n,m;
int h[N],w[N];
bool check(int x)
{
int cnt =0;
for(int i=1;i<=n;i ++ )
{
cnt += (h[i] /x) * (w[i] /x) ;
}
return cnt >=m;
}
void solve()
{
cin>>n>>m;
int l=1,r=1e5;
for(int i=1;i<=n;i ++)
{
cin>>h[i]>>w[i];
}
while(l<r)
{
int mid = l + r +1>> 1;
if(check(mid))l=mid;
else r = mid-1;
}
cout << r << endl;
}
int main()
{
ios
int T=1;
// cin>>T;
while(T -- )
{
solve();
}
return 0;
}