<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:
static bool mycomp(vector<int>&v1,vector<int>&v2){
    if(v1[0]==v2[0])return v1[1]>v2[1];
    else return v1[0]<v2[0];
}

// void fun1(vector<int>&v,int st,int en,int &c,vector<int>&cnt){

//     int l=st,md=(st+en)/2,r=md+1,f=0;
//     vector<int>temp;
//     while(l<=md && r<=en){
//         if(v[l]<v[r])f=1,temp.push_back(v[r]),r++;
//         else {
//             temp.push_back(v[l]),l++;}
//     }
//     while(l<=md){
//         temp.push_back(v[l]);
//         l++;
//     }
//     while(r<=en){
//         temp.push_back(v[r]);
//         r++;
//     }
//     for(int i=st;i<=en;i++){
//         v[i]=temp[i-st];
//     }

//     cout<<st<<" "<<en<<" "<<c<<endl;

// }


// void fun(vector<int>&v,int st,int en,int &c){
// if(st>=en)return;
// int mid=(st+en)/2;
// fun(v,st,mid,c);
// fun(v,mid+1,en,c);
// fun1(v,st,en,c);
// }



    int numberOfWeakCharacters(vector<vector<int>>& v) {
        sort(v.begin(),v.end(),mycomp);

  vector<int>temp;
  int l=0;
  for(int i=0;i<v.size();i++){
    temp.push_back(v[i][1]);

  }
  int mx=0,c=0;
  for(int i=temp.size()-1;i>=0;i--){
    if(temp[i]<mx)c++;
    mx=max(mx,temp[i]);
  }
  return c;
 
    }
};
133500