1
class Solution {
2
  public int numberOfWeakCharacters(int[][] properties) {
3
    int[] maxH = new int[100002];
4
    int count = 0;
5
    for (int[] point : properties) {
6
      maxH[point[0]] = Math.max(point[1], maxH[point[0]]);
7
    }
8
    for (int i = 100000; i >= 0; i--) {
9
      maxH[i] = Math.max(maxH[i + 1], maxH[i]);
10
    }
11

12
    for (int[] point : properties) {
13
      if (point[1] < maxH[point[0] + 1]) count++;
14
    }
15
    return count;
16
  }
17
}