[C++] Hashmap Solution
Code\ncpp []\nclass Solution {\npublic:\n    int winningPlayerCount(int n, vector<vector<int>>& pick) {\n        // Create Hashmap of <int, Hashmap>\n        un
# Code\n```cpp []\nclass Solution {\npublic:\n    int winningPlayerCount(int n, vector<vector<int>>& pick) {\n        // Create Hashmap of <int, Hashmap>\n        unordered_map<int, unordered_map<int, int>> map;\n        for (int i = 0; i < pick.size(); i++) {\n            int curPickPlayer = pick[i][0], curPickBall = pick[i][1];\n            if (map[curPickPlayer].contains(curPickBall)) {\n                map[curPickPlayer].at(curPickBall) += 1;    \n            }\n            else {\n                map[curPickPlayer][curPickBall] = 1;\n            }\n        }\n\n        // Iterate and update result variable\n        int result = 0;\n        for (auto kv1 : map) {\n            int playerId = kv1.first;\n            for (auto kv2 : kv1.second) {\n                if (kv2.second > playerId) {\n                    result++;\n                    break;\n                }\n            }\n        }\n        return result ;\n    }\n};\n```
['C++']