CodeForces - 231C To Add or Not to Add

To Add or Not to Add

A piece of paper contains an array of n integers a1, a2, …, an. 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 ≤ 105; 0 ≤ k ≤ 109) — 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 a1, a2, …, an (|ai| ≤ 109) — 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
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.
题意是给你一个长度为n的数组，最多有k次操作（这k次操作可以不用完）。每次可以将数组中的任意元素加一，问经过多少次适当的操作后，数组中出现次数最多的数字是什么。先输出次数，在输出出现次数最多的数字。
先排序，然后计算前缀和sum[i]。b是开始的位置，判断i到b之间的数变成a[i]所需要增加的总和，如果（i-b)*a[i]-(sum[i]-sum[b])>k，说明i到b这段数增加到a[i]不满足条件，则开始的位置向后移，即b++。

#include<iostream>
#include<cmath>
#include<algorithm>
typedef long long ll;
using namespace std;
ll a[100010];
ll sum[100010];
int main()
{
    ll n,k;
    cin>>n>>k;
    for(ll i=1;i<=n;i++)
        cin>>a[i];
    sort(a+1,a+n+1);
    for(ll i=1;i<=n;i++)
        sum[i]=sum[i-1]+a[i];
    ll b=0;
    ll ans=a[1],times=1;
    for(int i=2;i<=n;i++)
    {
        while((i-b)*a[i]-(sum[i]-sum[b])>k)
            b++;
        if(i-b>times)
        {
            times=i-b;
            ans=a[i];
        }
    }
    cout<<times<<" "<<ans<<endl;
}