easy approach
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```cpp []\nclass Solution {\npublic:\n    int winningPlayerCount(int n, vector<vector<int>>& pick) {\n        vector<vector<int>>v(n,vector<int>(11,0));\n        int a=0;\n        for(int i=0;i<pick.size();i++){\n            v[pick[i][0]][pick[i][1]]++;\n        }\n        for(int i=0;i<v.size();i++){\n            for(int j=0;j<v[i].size();j++){\n                if(v[i][j]>i){\n                    a++;\n                    break;\n                }\n            }\n        }\n        return a;\n    }\n};\n```
['C++']