Codeforces 671B／Round #352(div.2) D.Robin Hood 二分

D. Robin Hood

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 ci 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 ≤ 109) — 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 ci (1 ≤ ci ≤ 109) — initial wealth of the i-th person.

Output

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

Examples

input

4 1
1 1 4 2

output

2

input

3 1
2 2 2

output

0

Note

Lets look at how wealth changes through day in the first sample.

1. [1, 1, 4, 2]
2. [2, 1, 3, 2] or [1, 2, 3, 2]

So the answer is 3 - 1 = 2

In second sample wealth will remain the same for each person.

题意：给你n个数，每次能从最大的数一个移给最小的数，问k次操作后，最大和最小的数的差。

思路 : 题目可以简化成找最终状态下的最大值和最小值，那么分别进行二分最大值和最小值，此外注意二分最大、最小时的不同之处。

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;

const int MAX = 500010;
const int INF = 0x3f3f3f3f;
int a[MAX], n;

int findmax(int x, int k)
{
    for(int i = 0; i < n; i++)
    {
        if(a[i] > x)
            k-=a[i] - x;
        if(k < 0)
            return  0;
    }
    return 1;
}
int findmin(int x, int k)
{
    for(int i = 0; i < n; i++)
    {
        if(a[i] < x)
            k-=x - a[i];
        if(k < 0)
            return  0;
    }
    return 1;
}

int main()
{
    int k;
    __int64 sum = 0;
    int t1, t2;
    cin >> n >> k;
    t1 = 0;
    t2 = INF;
    for(int i = 0; i < n; i++)
    {
        scanf("%d", a + i);
        sum += a[i];
        t1 = max(t1, a[i]);
        t2 = min(t2, a[i]);
    }
    int mx = sum / n + (sum%n>0 ?1 : 0);
    int mi = sum / n;

    int l , r, maxx , minn;
    /////mi
    l = t2, r = mi;
    while(l <= r) //注意等于
    {
        int mid = (l + r) >> 1;
        if(findmin(mid, k))
        {
            l = mid + 1;
            minn =  mid;
        }
        else r = mid - 1;
    }
    ////ma
    l = mx, r = t1;
    while(l < r)
    {
        int mid = (l + r) >> 1;
        if(findmax(mid, k))
        {
            r = mid;
            maxx = max(mid, maxx);
        }
        else l = mid + 1;
    }
    maxx = (l +  r) >>1;   //结束状态时取
    printf("%d
", maxx - minn);
}