CodeForces 671B Robin Hood



Description

We all know the impressive story of Robin Hood. Robin Hood uses his archery skills and his wits to steal the money from rich, and return it to the poor.

There are n citizens in Kekoland, each person has c_i coins. Each day, Robin Hood will take exactly 1 coin from the richest person in the city and he will give it to the poorest person (poorest person right after taking richest's 1 coin). In case the choice is not unique, he will select one among them at random. Sadly, Robin Hood is old and want to retire in k days. He decided to spend these last days with helping poor people.

After taking his money are taken by Robin Hood richest person may become poorest person as well, and it might even happen that Robin Hood will give his money back. For example if all people have same number of coins, then next day they will have same number of coins too.

Your task is to find the difference between richest and poorest persons wealth after k days. Note that the choosing at random among richest and poorest doesn't affect the answer.

Input

The first line of the input contains two integers n and k (1 ≤ n ≤ 500 000, 0 ≤ k ≤ 10⁹) — the number of citizens in Kekoland and the number of days left till Robin Hood's retirement.

The second line contains n integers, the i-th of them is c_i (1 ≤ c_i ≤ 10⁹) — initial wealth of the i-th person.

Output

Print a single line containing the difference between richest and poorest peoples wealth.

Sample Input

Input

4 1
1 1 4 2

Output

2

Input

3 1
2 2 2

Output

0

题意：给定n个人并且知道每个人有多少钱，给定n个操作，每一次从这些人最富的人汇总拿出一块钱给最穷的人，求最后操作后最富和最穷的人钱数之差

理解：最后就是求mx-mi的值，看见这个东西直接懵逼，根本不知道如何来处理，后来上网看别人的见解，才知道是二分，当初学二分的时候，没有深深的理解二分，所以对二分一直很弱，首先二分求出mx的最小值，在二分求出mi的最大值，这样得到的值当然符合题意

AC代码：

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>

using namespace std;
typedef long long ll;

ll b[500005];
int n,k;//k次操作

int ok(int mx) {
    ll kk = 0,tt = 0;
    for(int i = 0; i < n; i++) {
        if(b[i] > mx) {//统计比当前答案大得可以拿出多少
            kk += (b[i]-mx);
        } else {//统计比当前答案小的一共得到多少
            tt += (mx-b[i]);
        }
    }
    if(kk <= k && tt >= kk) return 1;//多的数必须小于天数，并且小的必须大于多的，说明答案太大了
    return 0;
}
int ok2(int mi) {
    ll kk = 0,tt = 0;
    for(int i = 0; i < n; i++) {
        if(b[i] < mi) {
            kk += (mi-b[i]);//比当前答案小的总数
        } else {
            tt += (b[i]-mi);//比当前答案大的总数
        }
    }
    if(kk <= k && tt >= kk) return 1;//小的总数必须小于天数，大的总数大于小的总数，说明当前的答案太小
    return 0;
}

int main() {
    scanf("%d%d",&n,&k);
    for(int i = 0; i < n; i++) {
        scanf("%I64d",&b[i]);
    }
    sort(b,b+n);
    int mx = b[n-1],mi = b[0];
    int r = mx,l = mi;
    while(l<= r) {
        int mid = (l+r)/2;
        if(ok(mid)) {
            r = mid-1;
            mx = mid;
        } else {
            l = mid+1;
        }
    }
    r = b[n-1];
    l = b[0];
    while(l<= r) {
        int mid = (l+r)/2;
        if(ok2(mid)) {
            l = mid+1;
            mi = mid;
        } else {
            r = mid-1;
        }
    }
    printf("%d\n",mx-mi);
    return  0;
}
二分：对答案二分，一种手段，但是没学好，最近好好补回来，加油！！！！