# [3238\. Find the Number of Winning Players](https://leetcode.com/problems/find-the-number-of-winning-players/)

:::spoiler Hint

:::

:::spoiler Solution

class Solution {
public:
    int winningPlayerCount(int n, vector<vector<int>>& pick)
    {
        vector<vector<int>> mat(n, vector<int>(11, 0));

        int res = 0;

        for (int i = 0; i < pick.size(); ++i)
        {
            int player = pick[i][0];
            int color = pick[i][1];
            mat[player][color]++;
        }

        for (int i = 0; i < n; ++i)
        {
            for (int j = 0; j <= 10; ++j)
            {
                if (mat[i][j] > i)
                {
                    res++; break;
                }
            }
        }
        return res;           
    }
};

- T: $O(n)$
- S: $O(n)$
:::