#include <bits/stdc++.h>   const int inf = (1 << 30) - 1;   const double eps = 1e-9;   using namespace std;   int a[111111], n, k, mx = 0, aa;   long long s[111111];   int main() {     scanf( %d%d , &n, &k);     for (int i = 1; i <= n; i++) scanf( %d , &a[i]);     sort(a + 1, a + n + 1);     for (int i = 1; i <= n; i++) s[i] = s[i - 1] + a[i];     for (int i = 1; i <= n; i++) {       int l = 1, r = i;       while (r > l) {         int m = (l + r) / 2;         long long ss = s[i] - s[m - 1];         if (1ll * a[i] * (i - m + 1) - ss > k)           l = m + 1;         else           r = m;       }       if (i - r + 1 > mx) {         mx = i - r + 1;         aa = a[i];       }     }     cout << (mx) <<    ;     cout << (aa) << endl;     return 0;   }   