public class Solution {
public int maxCount(int m, int n, int[][] ops) {
if (ops == null || ops.length < 1) return m * n;
int minI = ops[0][0];
int minJ = ops[0][1];
for (int[] op : ops) {
minI = Math.min(minI, op[0]);
minJ = Math.min(minJ, op[1]);
}
return minI * minJ;
}
}