AcWing 1227. 分巧克力--Java
原题链接
简单
作者:
Jiang锋时刻
,
2021-01-31 15:00:45
,
所有人可见
,
阅读 311
Java 代码
import java.util.*;
import java.io.*;
public class Main {
static int m;
static int n;
static int[][] res;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
m = sc.nextInt();
n = sc.nextInt();
res = new int[m][2];
for(int i = 0; i < m; i++) {
for(int j = 0; j < 2; j++) {
res[i][j] = sc.nextInt();
}
}
int left = 0, right = 100000;
while(left < right) {
int mid = left + (right - left + 1) / 2;
if(check(mid)) {
left = mid;
} else {
right = mid - 1;
}
}
System.out.println(left);
}
public static boolean check(int len) {
int ans = 0;
for(int i = 0; i < m; i++) {
ans += (res[i][0] / len) * (res[i][1] / len);
}
if(ans >= n) {
return true;
}
return false;
}
}