Java Clean 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: \uD835\uDC42(m) - m is total number of picks \n\n\n- Space complexity: \uD835\uDC42(m+n)\n\n\n# Code\n```\nclass Solution {\n    public int winningPlayerCount(int n, int[][] pick) {\n        Map<Integer,Map<Integer,Integer>> playerMap=new HashMap<>();\n        int m=pick.length,res=0;\n        boolean win[]=new boolean[n+1];\n        for(int i=0;i<m;i++)\n        {\n            int[]curr=pick[i];\n            if(win[curr[0]])\n            continue;\n            Map<Integer,Integer> colorMap=playerMap.getOrDefault(curr[0],new HashMap<>());\n            int freq=colorMap.getOrDefault(curr[1],0)+1;\n            if(freq>curr[0])\n            {\n                res++;\n                win[curr[0]]=true;\n            }\n            colorMap.put(curr[1],freq);\n            playerMap.put(curr[0],colorMap);\n        }\n        return res;\n    }\n}\n```
['Java']