Java solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int winningPlayerCount(int n, int[][] pick) {
        int winCount = 0;
        Map<Integer, Map<Integer, Integer>> m = new HashMap();
        for (int i  = 0; i < pick.length; i++) {
            int playerNumber = pick[i][0];
            int color = pick[i][1];

            m.putIfAbsent(playerNumber, new HashMap());

            Map<Integer, Integer> colorMap = m.get(playerNumber);
            colorMap.putIfAbsent(color, 0);
            colorMap.put(color, colorMap.get(color) + 1);
        }

        for (int i = 0; i < n; i++) {
            Map<Integer, Integer> colorMap = m.get(i);
            if (colorMap != null) {
                for (Map.Entry e : colorMap.entrySet()) {
                    int pickedCount = (int) e.getValue();
                    if (pickedCount > i) {
                        winCount++;
                        break;
                    }
                }
            }
        }
        return winCount;
    }
}

/*
map<color, count>

*/
```
['Java']