Count Winning Players

There are n players numbered 0 to n-1. Each entry [xi, yi] in the pick array means player xi picked color yi. A player wins if they have strictly more picks of some color than every other player. Each player can win at most once. Return the number of winning players.

Examples
Input: [4,[[0,0],[1,0],[1,0],[2,1],[2,1],[2,1]]]
Output: 2
Hints

Count Winning Players

There are n players numbered 0 to n-1. Each entry [xi, yi] in the pick array means player xi picked color yi. A player wins if they have strictly more picks of some color than every other player. Each player can win at most once. Return the number of winning players.