1
class Solution {
2
public:
3
int maxCount(int m, int n, vector<vector<int>> &ops) {
4
int mn_i = m, mn_j = n;
5
for (auto &i : ops) mn_i = min(mn_i, i[0]), mn_j = min(mn_j, i[1]);
6

7
return mn_i * mn_j;
8
}
9
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0