day-12:范围求和

class Solution {
    public int maxCount(int m, int n, int[][] ops) {
        int min1 = m, min2 = n;
        for(int[] l: ops){
            min1 = Math.min(min1,l[0]);
            min2 = Math.min(min2,l[1]);
        }
        return min1*min2;
    }
}