codeforces 231 C

题目

C. To Add or Not to Add

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A piece of paper contains an array of n integers a₁, a₂, ..., a_n. Your task is to find a number that occurs the maximum number of times in this array.

However, before looking for such number, you are allowed to perform not more than k following operations — choose an arbitrary element from the array and add 1 to it. In other words, you are allowed to increase some array element by 1 no more than k times (you are allowed to increase the same element of the array multiple times).

Your task is to find the maximum number of occurrences of some number in the array after performing no more than k allowed operations. If there are several such numbers, your task is to find the minimum one.

Input

The first line contains two integers n and k (1 ≤ n ≤ 10⁵; 0 ≤ k ≤ 10⁹) — the number of elements in the array and the number of operations you are allowed to perform, correspondingly.

The third line contains a sequence of n integers a₁, a₂, ..., a_n (|a_i| ≤ 10⁹) — the initial array. The numbers in the lines are separated by single spaces.

Output

In a single line print two numbers — the maximum number of occurrences of some number in the array after at most k allowed operations are performed, and the minimum number that reaches the given maximum. Separate the printed numbers by whitespaces.

Examples

Input

Copy

5 3
6 3 4 0 2

Output

Copy

3 4

Input

Copy

3 4
5 5 5

Output

Copy

3 5

Input

Copy

5 3
3 1 2 2 1

Output

Copy

4 2

Note

In the first sample your task is to increase the second element of the array once and increase the fifth element of the array twice. Thus, we get sequence 6, 4, 4, 0, 4, where number 4 occurs 3 times.

In the second sample you don't need to perform a single operation or increase each element by one. If we do nothing, we get array 5, 5, 5, if we increase each by one, we get 6, 6, 6. In both cases the maximum number of occurrences equals 3. So we should do nothing, as number 5 is less than number 6.

In the third sample we should increase the second array element once and the fifth element once. Thus, we get sequence 3, 2, 2, 2, 2, where number 2 occurs 4 times.

有n个数可以进行k次操作每次可以对一个数进行+1问在最多进行k次操作后最多的数有几个分别输出出现的的次数和和这个数，如果有相同的次数输出最小的。
可以通过前缀和先排序一下求出前缀和，然后求出这些数到达"最大值"一共所需要多少次操作然后和k比较最后特判一下如果出现次数相同时换成小的数。还有再进行循环的时候我们已经知道了最大值所以区间左端点开始小于最大出现次数的区间长度没有必要去考虑直接往后找。

##includeinclude<bits/stdc++.h><bits/stdc+ 
#define ll long long
using namespace std;
int main()
{
    ll maxx=-1,nn=-1;
    ll n,k,a[100009],b[100009];
    memset(b,0,sizeof(b));
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a+1,a+1+n);
    b[0]=0;
    for(int i=1;i<=n;i++)
    {
        b[i]=b[i-1]+a[i];
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=i+maxx-1;j<=n;j++)
        {
            if((ll)(j-i+1)*a[j]-(b[j]-b[i-1])<=k)
            {
                if(j-i+1>maxx||j-i+1==maxx&&a[j]<nn)
                {
                    maxx=j-i+1;
                    nn=a[j];
                }
            }
            else break;
        }
    }
    cout<<maxx<<' '<<nn<<endl;


}