java_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 {\n    public int winningPlayerCount(int n, int[][] pick) {\n        \n        HashMap<Integer,int[]>map=new HashMap<>();\n\n        for(int i=0;i<n;i++){\n            map.put(i,new int[11]);\n        }\n        for(int a[]:pick){\n            int u=a[0];\n            int v=a[1];\n            int arr[]=map.get(u);\n            arr[v]++;\n        }\n        int count=0;\n        for(Map.Entry<Integer,int[]>e:map.entrySet()){\n            int u=e.getKey();\n            int arr[]=e.getValue();\n            for(int i=0;i<11;i++){\n                if(arr[i]>u){\n                    count++;\n                    break;\n                }\n            }\n        }\n        return count;\n    }\n}\n```
['Java']