2019沈阳网络赛Honk's pool(二分）

题意：有n个数，进行k次操作，每次找到最大的减1，然后最小的加1，求k次后最大值与最小值之差。

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=5e5+10;
int n,k;
int num[maxn];
bool check1(int x){
    ll ret=0;
    for(int i=1;i<=n;++i)
        if(num[i]<x)
            ret+=x-num[i];//若k次后最小的数是x，那所有比x小的数都要加到x 
		}
    if(ret<=k) return true;
    else return false;
}
bool check2(int x){
    ll ret=0;
    for(int i=1;i<=n;++i)
        if(num[i]>x)
            ret+=num[i]-x;
    if(ret<=k) return true;
    else return false;
}
int solvel(int l,int r){
    int ret=l,mid;
    while(l<=r){
        mid=(l+r)>>1;
        if(check1(mid)){
            ret=mid;
            l=mid+1;
        }else{
            r=mid-1;
        }
    }
    return ret;
}
int solver(int l,int r){
    int ret=l,mid;
    while(l<=r){
        mid=(l+r)>>1;
        if(check2(mid)){
            ret=mid;
            r=mid-1;
        }else {
            l=mid+1;
        }
    }
    return ret;
}
int main(){
//    freopen("in3.txt","r",stdin);
//    freopen("out3.txt","w",stdout);
    while(~scanf("%d %d",&n,&k)){
    ll sum=0;
    int tl,tr,ansl,ansr;
    int mx=0,mi=1e9+10;
    for(int i=1;i<=n;++i){
        scanf("%d",&num[i]);
        sum+=num[i];
        mx=max(mx,num[i]);
        mi=min(mi,num[i]);
    }
    tl=sum/n;
    tr=(sum+n-1)/n;
    ansl=solvel(mi,tl);//二分找最大值和最小值 
    ansr=solver(tr,mx);
    printf("%d\n",ansr-ansl);
	    	
	}
    return 0;
}
/*
*/