1
class Solution {
2
  public int maxCount(int m, int n, int[][] ops) {
3
    int minRow = m, minCol = n;
4
    for (int[] op : ops) {
5
      minRow = Math.min(minRow, op[0]);
6
      minCol = Math.min(minCol, op[1]);
7
    }
8
    return minRow * minCol;
9
  }
10
}