#include <bits/stdc++.h>
using namespace std;

int selfSufficentColony(int N, int X, vector<int> &A)
{
    sort(A.begin(), A.end(), greater<int>());

    for (int i = 1; i < N; i++)
    {
        A[i] += A[i - 1];
    }

    int ans = 0;
    for (int i = 0; i < N; i++)
    {
        if (A[i] >= ((i + 1) * X))
        {
            ans = i + 1;
        }
    }

    return ans;
}

int main()
{
    int N, X;
    cin >> N >> X;

    vector<int> Q(N);
    for (int i = 0; i < N; i++)
    {
        cin >> Q[i];
    }

    cout << selfSufficentColony(N, X, Q) << endl;
}