blob: 06fa2db3d87d10546a4a10e4509bc6f8253b29d5 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
#include "leetcode.h"
class Solution {
public:
int numberOfWeakCharacters(vvd & properties) {
sort(properties.begin(), properties.end(), compare);
int currMax = INT_MIN, ans = 0;
for (auto p : properties) {
if (currMax > p[1])
ans++;
else
currMax = p[1];
}
return ans;
}
private:
static bool compare(vector<int> &a, vector<int> &b) {
if (a[0] != b[0])
return a[0] > b[0];
return a[1] < b[1];
}
};
|