AcWing 1227. 分巧克力Java二分
原题链接
简单
作者:
还想听你的故事
,
2021-01-15 10:03:31
,
所有人可见
,
阅读 332
import java.util.*;
public class Main{
private static int N=100005;
private static int n;
private static int k;
private static int H[]=new int [N];
private static int W[]=new int[N];
public static void main(String[]args){
Scanner sc=new Scanner(System.in);
n=sc.nextInt();
k=sc.nextInt();
for(int i=0;i<n;i++){
H[i]=sc.nextInt();
W[i]=sc.nextInt();
}
int l=1,r=100001;
int res=0;
while(l<=r){
int mid=(l+r)>>1;
int count=0;
for(int i=0;i<n;i++){
count+=(H[i]/mid)*(W[i]/mid);
}
if(count>=k){
res=mid;
l=mid+1;
}else{
r=mid-1;
}
}
System.out.println(res);
}
}