Simple java solution -> Beats 100.00%
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:\nO(n)\n\n- Space complexity:\nO(n)\n\n# Code\n```java []\nclass Solution {\n    public int winningPlayerCount(int n, int[][] pick) {\n\n        int ans = 0;\n        int[][] players = new int[n][];\n        for (int i = 0; i < players.length; i++)\n            players[i] = new int[11];\n\n        for (int[] p : pick)\n            players[p[0]][p[1]]++;\n\n        for (int i = 0; i < players.length; i++)\n            for (int color : players[i])\n                if (color > i) {\n                    ans++;\n                    break;\n                }\n\n        return ans;\n    }\n}\n```
['Java']