✅✅BEST AND SIMPLE 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\n        vector<vector<int>> v(10, vector<int>(11, 0));\n\n        for(int i=0; i<pick.size(); i++) {\n            v[pick[i][0]][pick[i][1]]++;\n        }  \n\n        int cnt = 0;\n\n        for(int i=0; i<n; i++) {\n            for(int j=0; j<=10; j++) {\n                if(v[i][j] >= i+1) {\n                    cnt++;\n                    break;\n                }\n            }\n        }\n        \n        return cnt;\n    }\n};\n```
['C++']