# 1996. The Number of Weak Characters in the Game

```

T: O(nlogn + n)
S: O(n)
```

```java
class Solution {
    public int numberOfWeakCharacters(int[][] properties) {
        Arrays.sort(properties, (a, b) -> {
            if (a[0] == b[0]) {
                return b[1] -  a[1];
            }
            return a[0] - b[0];
        });
        Deque<Integer> stack = new ArrayDeque<>();
        int result = 0;
        for (int[] property : properties) {
           while (!stack.isEmpty() && property[1] > stack.peek()) {
               stack.pop();
               result++;
           }
           stack.push(property[1]);
        }
        return result;
    }
}
/*
[[1,1],[2,1],[2,2],[1,2]]
[1,1], [1,2],[2,1],[2,2]


sort attack first, fix one value

then use mono stack, decreasing, if larger than peak, get the weak one 

but if attack equals, how we get the right ans?
ex:
[1,1], [1,2] -> in this case, we should not pop [1,1], because attack equals
the tricks is do the when attack equals, do defense sort by desc
-> become 

[1,2], [1,1] -> in this way, it wont pop, it's correct

T: O(nlogn + n)
S: O(n)
*/ja
```

## using Heap

```python
class Solution:
    def numberOfWeakCharacters(self, properties: List[List[int]]) -> int:
        att_defs = defaultdict(list) # {1:[5],4:[3],10:[4]}
        for at, df in properties:
            att_defs[at].append(df)
        min_heap_def = [] # [5]
        res = 0 # 1
        for at in sorted(att_defs.keys()): # 10  [[1,5],[4,3]] [10,4]. 5 3 4
            for df in att_defs[at]: # df:4
                while min_heap_def and df > min_heap_def[0]:
                    res += 1
                    heapq.heappop(min_heap_def)
            for df in att_defs[at]:
                heapq.heappush(min_heap_def, df)
        return res
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://timmybeeflin.gitbook.io/cracking-leetcode/stack/mono-stack/1996.-the-number-of-weak-characters-in-the-game.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.