CodeForces 231C 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.
基本思路：
首先进行从小到大排序，这样可以使最接近的几个数都聚在一起，然后用(i-j+1)*a[i]-sum;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)//从小到大依次排列，此步中默认了j>i的略过操作
        {
            sum-=a[j++]; //依次删除使得sum临界的最小的元素
        }
        if(i-j+1>max)
        {
            max=i-j+1;
            maxi=a[i];
        }
    }
    cout<<max<<" "<<maxi<<endl;
    return 0;
}

也可以用二分

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
 
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int N = 100010;
LL a[N], sum[N];
 
int main() {
   int n; LL k;
   while (~scanf("%d %I64d", &n, &k)) {
       for (int i = 1; i <= n; i++) scanf("%I64d", &a[i]);
       sort(a + 1, a + 1+n);
       int r = INF, l = 0;
       sum[1] = a[1];
       for (int i = 2; i <= n; i++) sum[i] = a[i] + sum[i-1];
       LL ans;
       while (r - l > 1) {
           int m = (r+l) / 2;
           if (m > n) { r = m; continue; }
           int flag = 0;
            for (int i = m; i <= n; i++) {
                if ((m-1)*a[i] - sum[i-1] +sum[i-m] <= k){
                    flag = 1; ans = a[i];
                    break;
                }
           }
           flag ? l = m : r = m;
       }
       printf("%d %I64d\n", l, ans);
    }
   return 0;
}

然后不客观的比较
大致上能看出来使用二分虽然在空间上多了近一倍，但是在时间按复杂度上快了很多