CF_231C

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

main()
{
    ll n,k;
    cin>>n>>k;
    ll a[n];
    for(int i=0;i<=n;i++)
    {
        ll t;
        cin>>t;
        a[i]=t;
    }
    sort(a,a+n);
    ll ans=1;
    ll ansv=a[0];
    ll sm=0;
    ll l=0;
    for(int i=1;i<=n;i++)
    {
        sm+=(a[i]-a[i-1])*(i-l);
        while(sm>k)
        {
            sm-=a[i]-a[l];
            l++;
        }
        if(i-l+1>ans)
        {
            ans=i-l+1;
            ansv=a[i];
        }
    }
    cout<<ans<<' '<<ansv;
    return 0;
}