int maxCount(int m, int n, vector<vector<int>>& ops)
{
if (ops.empty()) return m*n;
int minx = INT_MAX, miny = INT_MAX;
for (int i = 0; i < ops.size(); i++)
{
minx = min(minx, ops[i][0]);
miny = min(miny, ops[i][1]);
}
return minx*miny;
}
C++ Solution (Calculate Min Pair)

@Jowang Thank you for pointing out.
However, the question says(Note:):
The range of a is [1,m], and the range of b is [1,n].
a,b can't be greater than m,n.