The Preliminary Contest for ICPC Asia Shenyang 2019 Honk's pool

https://nanti.jisuanke.com/t/41406 

思路：判断是否都能达到平均值；否则小的一直加k次，大的减k次；

反思：最小的有余数的话不是加1，因为多出的平均加到最小组时，余数使得一些大了，要取最小的，最小的没余数剩下的给； 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------

const int maxn=1e6+9;
const int maxm=5e6+9;
const int mod=1e9+7;
//const int INV6=166666668;


ll a[maxn];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int n;
    ll k;
    while(cin>>n>>k)
    {
        ll Min=1e18;
        ll Max=0;
        ll sum=0;
        for(int i=1;i<=n;i++) cin>>a[i],sum+=a[i];
        sort(a+1,a+n+1);

        if(n==1)
        {
            cout<<0<<endl;
            continue;
        }

        ll ha=sum/n;

        ll sum1=0;
        for(int i=1;i<=n;i++)
        {
            if(a[i]<ha) sum1+=ha-a[i];
            else break;
        }

        //cout<<ha<<endl;

        if(k>=sum1)
        {
            if(sum%n==0)
            {
                cout<<0<<endl;
            }
            else cout<<1<<endl;

        }
        else
        {
            ll sum2=0;

            ll kk=0;
            ll cnt=1;
            for(int i=1;i<n;i++)
            {
                if(a[i]>ha) break;

                ll cha=a[i+1]-a[i];
                if(cha==0)
                {
                    cnt++;
                    continue;
                }
                if(sum2+cha*(cnt)<k)
                {
                    sum2+=cha*cnt;
                    cnt++;
                }
                else if(sum2+cha*cnt==k)
                {
                    sum2+=cha*cnt;
                    cnt++;
                    kk=a[i+1];
                    break;
                }
                else
                {
                    kk=a[i];
                    break;
                }
            }

            //cout<<kk<<endl;


            ll yu=(k-sum2)/(cnt);
            Min=kk+yu;


            cnt=1;
            ll sum3=0;
            for(int i=n;i>1;i--)
            {
                if(a[i]<ha) break;

                ll cha=a[i]-a[i-1];

                if(cha==0)
                {
                    cnt++;
                    continue;
                }

                if(sum3+cha*(cnt)<k)
                {
                    sum3+=cha*cnt;
                    cnt++;
                }
                else if(sum3+cha*cnt==k)
                {
                    sum3+=cha*cnt;
                    cnt++;
                    kk=a[i-1];
                    break;
                }
                else
                {
                    kk=a[i];
                    break;
                }

            }


            yu=(k-sum3)/(cnt);

            //cout<<sum3<<endl;

            Max=kk-yu;
            //cout<<Max<<" "<<Min<<" ";

            cout<<Max-Min<<endl;

        }


    }


    return 0;
}