def maxCount(self, m, n, ops):
"""
:type m: int
:type n: int
:type ops: List[List[int]]
:rtype: int
"""
return min(ops, key=lambda e: e[0])[0] * min(ops, key=lambda e: e[1])[1] if ops else m * n

@alexander yeah,you solution is good,we are almost same,this is my java code:

public class Solution {
public int maxCount(int m, int n, int[][] ops) {
for(int i=0;i<ops.length;i++){
if(ops[i][0]<m) m=ops[i][0];
if(ops[i][1]<n) n=ops[i][1];
}
return m*n;
}
}