Hashing ONLY!!!!
Intuition\nHashing \n\n# Approach\nHash and find where player[i] is < its occurence .\n\n# Complexity\n- Time complexity:\n Add your time complexity here, e.g. 
# Intuition\nHashing \n\n# Approach\nHash and find where player[i] is < its occurence .\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```cpp []\nclass Solution {\npublic:\n    int winningPlayerCount(int n, vector<vector<int>>& pick) \n    {\n        map < vector<int>,int> mpp;\n        set<int> s;\n        for(int i =0;i<pick.size();i++)\n        {\n           mpp[ pick[i]]++;\n            \n        }\n        for(auto it : mpp)\n        {\n            cout<<it.first[0]<<" "<<it.first[1]<<" "<<it.second<<endl;\n            if(it.first[0]<it.second)\n            {\n                s.insert(it.first[0]);\n            }\n        }\n        return s.size();\n    }\n};\n```
['C++']