CodeForces - 231C .二分 说是二分 我第一次

..我太菜，所以我看了好久才懂的代码，理解着敲的 变量及核心大部分是看大神的，但是自己敲出来的更香

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.

Example

Input

5 3
6 3 4 0 2

Output

3 4

Input

3 4
5 5 5

Output

3 5

Input

5 3
3 1 2 2 1

Output

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.

emmmm要简单来说呢这道题，就是先计算出前几个紧凑在一起的数 (因为题中要求的是最小值，所以呢先用sort排序)看他们能否在k次操作内（含k）形成最多的相同的数a[i],  用j来记录下限，即在最左边能形成的a[i]的位置，那么i-j+1就是次数了，出现

i-j+1次a[i],那么和就是（i-j+1）*a[i], 用sum 表示sum是i到j这i-j+1个数的和  当(i-j+1)*a[i]>sum+k的时候，就是要补的超过k了，形不成那么多的a[i]，这时候就要将最占k次数的数减去a[j]，因为它是离i最远的，那就是sum-=a[j++]，

用while((i-j+1)*a[i]>sum+k)来判断的，因为后边数是否满足还是需要判断的。最后比较个数就可以了，，，说了这么多是让我更好的在弄清楚，，，慢慢来吧，另外注意用long long，毕竟筛选的话时间超限

#include<bits/stdc++.h>  
using namespace std;  
int main(){  
    int n;  
    long long k;  
    //freopen("test.txt","r",stdin);  
    while(~scanf("%d%I64d",&n,&k)){  
        long long a[100005];  
        for(int i=1;i<=n;i++){  
            scanf("%I64d",&a[i]);  
        }  
        sort(a+1,a+1+n);  
        long long ans1=0,ans2=0;  
        long long j=1;  
        long long sum=0;  
        for(long long i=1;i<=n;i++){  
            sum+=a[i];  
            while((i-j+1LL)*a[i]-sum>k){  
                sum-=a[j++];  
            }  
            if(i-j+1>ans2){  
                ans2=i-j+1;  
                ans1=a[i];  
            }  
        }  
        printf("%I64d %I64d\n",ans2,ans1);  
    }  
    return 0;  
}