598. Range Addition II

static int wing=[]()
{
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    return 0;
}();

class Solution 
{
public:
    int maxCount(int m, int n, vector<vector<int>>& ops) 
    {
        int minrow=m,mincol=n;
        for(vector<int> &v:ops)
        {
            minrow=min(minrow,v[0]);
            mincol=min(mincol,v[1]);
        }
        return minrow*mincol;
    }
};

找到最小值即可，问题不大