simple c++ solution
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        int ans = 0;\n        vector<vector<int>>temp(n,vector<int>(11,0));\n        vector<int>won(n,-1);\n        for(auto i:pick){\n            temp[i[0]][i[1]]++;\n            if(temp[i[0]][i[1]]>i[0] && won[i[0]]==-1){\n                ans++;\n                won[i[0]]=1;\n            }\n        }\n        return ans;\n    }\n};\n```
['C++']