CF671B.Robin Hood

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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 nn citizens in Kekoland, each person has cic_{i} coins. Each day, Robin Hood will take exactly 11 coin from the richest person in the city and he will give it to the poorest person (poorest person right after taking richest's 11 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 kk 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 kk days. Note that the choosing at random among richest and poorest doesn't affect the answer.

输入格式

The first line of the input contains two integers nn and kk ( 1<=n<=500000,0<=k<=1091<=n<=500000,0<=k<=10^{9} ) — the number of citizens in Kekoland and the number of days left till Robin Hood's retirement.

The second line contains nn integers, the ii -th of them is cic_{i} ( 1<=ci<=1091<=c_{i}<=10^{9} ) — initial wealth of the ii -th person.

输出格式

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

输入输出样例

  • 输入#1

    4 1
    1 1 4 2
    

    输出#1

    2
    
  • 输入#2

    3 1
    2 2 2
    

    输出#2

    0
    

说明/提示

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

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

So the answer is 31=23-1=2

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

首页