<p>You are playing a game that contains multiple characters, and each of the characters has <strong>two</strong> main properties: <strong>attack</strong> and <strong>defense</strong>. You are given a 2D integer array <code>properties</code> where <code>properties[i] = [attack<sub>i</sub>, defense<sub>i</sub>]</code> represents the properties of the <code>i<sup>th</sup></code> character in the game.</p>

<p>A character is said to be <strong>weak</strong> if any other character has <strong>both</strong> attack and defense levels <strong>strictly greater</strong> than this character&#39;s attack and defense levels. More formally, a character <code>i</code> is said to be <strong>weak</strong> if there exists another character <code>j</code> where <code>attack<sub>j</sub> &gt; attack<sub>i</sub></code> and <code>defense<sub>j</sub> &gt; defense<sub>i</sub></code>.</p>

<p>Return <em>the number of <strong>weak</strong> characters</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> properties = [[5,5],[6,3],[3,6]]
<strong>Output:</strong> 0
<strong>Explanation:</strong> No character has strictly greater attack and defense than the other.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> properties = [[2,2],[3,3]]
<strong>Output:</strong> 1
<strong>Explanation:</strong> The first character is weak because the second character has a strictly greater attack and defense.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> properties = [[1,5],[10,4],[4,3]]
<strong>Output:</strong> 1
<strong>Explanation:</strong> The third character is weak because the second character has a strictly greater attack and defense.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>2 &lt;= properties.length &lt;= 10<sup>5</sup></code></li>
	<li><code>properties[i].length == 2</code></li>
	<li><code>1 &lt;= attack<sub>i</sub>, defense<sub>i</sub> &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution {
public:
    int numberOfWeakCharacters(vector<vector<int>>& p) {
        sort(p.begin(),p.end());      
        int n = p.size(); 
        vector<int> right(n,-1);
        int maxi = -1;
        for(int i=n-1;i>=0;i--){
            
            maxi = max(maxi, p[i][1]);
            right[i] = maxi;
        }
        // for(auto c : right){
        //     cout << c << " ";
        // }
        // cout << endl;
        vector<int> next(n);
        next[n-1] = n;
        int last = n;
        for(int i=n-2;i>=0;i--){
            if(p[i][0] == p[i+1][0]){
                next[i] = last;
            }
            else{
                next[i] = i+1;
                last = i+1;
            }
        }
        // for(auto c : next){
        //     cout << c << " ";
        // }
        // cout << endl;
        int count = 0;
        for(int i=0;i<n-1;i++){
            int ub = next[i];
            // cout << ub << endl;
            if(ub < n){
                // cout << "here" << endl;
                if(right[ub] > p[i][1]) count++;
            }
        }
        // vector<vector<int>> v = {{2,3},{4,5}};
        // int lb = lower_bound(v.begin(),v.end(),vector<int>({3,0})) - v.begin();
        // cout <<lb;
        return count;
    }
};
132700