Understand in easy way in c++ using hashmap
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```\nclass Solution {\npublic:\n    int winningPlayerCount(int n, vector<vector<int>>& pick) {\n        vector<unordered_map<int,int>> mp(n);\n        for(int i = 0; i<pick.size(); i++){\n            int val = pick[i][0];\n            int col = pick[i][1];\n            mp[val][col]++;\n        }\n        int count = 0;\n        for(int i = 0; i<n; i++){\n            for(auto temp:mp[i]){\n                int col = temp.first;\n                int freq = temp.second;\n                if(freq>i){\n                    count++;\n                    break;\n                }\n            }\n        }\n        return count;\n    }\n};\n```
['Array', 'Hash Table', 'C++']