题目链接:https://leetcode-cn.com/problems/range-addition-ii/
题目如下:
class Solution {
public:
int maxCount(int m, int n, vector<vector<int>>& ops) {
int a=m,b=n;
for(int i=0;i<ops.size();i++){
if(ops[i][0]<a) a=ops[i][0];
if(ops[i][1]<b) b=ops[i][1];
}
return a*b;
}
};