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

#ifdef DEBUG
ifstream in_file("minta/be1.txt");
#define input in_file
#else
#define input cin
#endif
typedef long long ll;

ll N, K, ossz;
ll P[200'000];

int main() {
    input >> N >> K;
    K *= N;
    for (int n = 0; n < N; n++) {
        input >> P[n];
        ossz += P[n];
    }
    if (K > ossz) {
        cout << 1 << endl;
        exit(0);
    }
    if (ossz == K) {
        cout << 0 << endl;
        exit(0);
    }
    if (N == 1) {
        cout << 1 << endl;
        exit(0);
    }
    if (N == 2) {
        // cout << K << " " << P[0] << " " << P[1] << endl;
        if (K > max(P[0], P[1])+1'000'000)
            cout << 2 << endl;
        else if (K < min(P[0], P[1])+1) {
            cout << 2 << endl;
        }
        else
            cout << 1 << endl;
        exit(0);
    }
    sort(P, P+N);
    ll r = 0;
    if (K > ossz) {
        for (ll i = 0; i < N; i++) {
            ossz += 1'000'000-P[i];
            r++;
            if (ossz >= K) {
                cout << r << endl;
                exit(0);
            }
        }
    }
    else {
        for (ll i = N-1; i >= 0; i--) {
            ossz -= P[i]-1;
            r++;
            if (ossz <= K) {
                cout << r << endl;
                exit(0);
            }
        }
    }
}