CodeForces - 231C To Add or Not to Add（前缀和+贪心）

Problem Description

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 4times.

 

题意:

给你一个长度为n的数组，最多有k次操作（这k次操作可以不用完）。每次可以将数组中的任意元素加一，问经过多少次适当的操作后，数组中出现次数最多的数字是什么。先输出次数，再输出出现次数最多的数字。并且要使这个数尽量小。

 

思路：

首先进行sort排序，这样可以使最接近的数都聚在一起，然后用(i-j+1)*a[i]-sum;通过判断sum和k的关系来决定，若sum>k则sum-=a[j++];这样可以始终获得以i-j+1为重复出现次数，从而算出重复最多的数，又因为是从小到大排列的，所以可以找出符合条件的最小数。

 

代码：

#include<iostream>
#include<algorithm>
using namespace std;
#define N 100005
long long  a[100005];
int main()
{
    long long  n,k;
    cin>>n>>k;
    for(long long  i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a+1,a+1+n);
    long long  sum=0;
    long long  j=1;
    long long  maxi=0,max=0;
    for(long long  i=1;i<=n;i++)
    {
        sum+=a[i];
        while((i-j+1)*a[i]-sum>k)
        {
            sum-=a[j++]; 
        }
        if(i-j+1>max)
        {
            max=i-j+1;
            maxi=a[i];
        }
    }
    cout<<max<<" "<<maxi<<endl;
    return 0;
}