can anyone tell me why this solution fails and showing error?
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n\n#include<bits/stdc++.h>\nclass Solution {\npublic:\n    int winningPlayerCount(int n, vector<vector<int>>& pick) {\n     sort(pick.begin(),pick.end());\n     map<pair<int,int>,int>mpp;\n     for(int i=0;i<n;i++)\n     {\n        mpp[{pick[i][0],pick[i][1]}]++;\n     } \n     int cnt=0;\n     for(auto it:mpp)\n     {\n        if(it.second>=it.first.first) cnt++;\n     }\n     return cnt;\n\n    }\n};\n```
['C++']