brute force but easy to understand 
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
```python []
class Solution(object):
    def winningPlayerCount(self, n, pick):
        """
        :type n: int
        :type pick: List[List[int]]
        :rtype: int
        """
        pick_arr = [{}for _ in range(n)]

        for i in range(len(pick)):
            if pick[i][1] not in pick_arr[pick[i][0]]: 
                pick_arr[pick[i][0]][pick[i][1]] = 1
            else:
                pick_arr[pick[i][0]][pick[i][1]] +=1

        count = 0
        for i in range(n):
            if pick_arr[i] and max(pick_arr[i].values()) > i:
                count +=1
                
        return count
            





        
```
['Python']