CodeForces - 672D _Robin Hood_二分

题意

城里有 n 户人家，每户人家有 mi 个金币。robin 每天从最富的人家偷一个金币送给最穷的一户人家。问 k 天后最富的一户人家比最穷的一户人家多多少金币。

思路

分别二分最富人家金币的最小值，和最穷人家金币的最大值，作差即可。
特别的，可以将金币数排序后，用前缀和减少运算。

链接

https://vjudge.net/contest/175446#problem/I

代码

#include<cstdio>
#include<iostream>
#include<algorithm>

using namespace std;

typedef long long LL;

const int maxn = 5e5 + 10;
const LL inf  = 0x3f3f3f3f;

LL n, k;
LL A[maxn];
LL sum[maxn];
LL M, m;

inline bool Judge(LL x)
{
    int v = upper_bound(A, A+n, x) - A;
    LL cnt = x * v - sum[v-1];
    if(cnt > k) return false;
    return true;
}

LL solve_min()
{
    LL res = m;
    LL lb = m, ub = sum[n-1] / n;
    while(lb <= ub)
    {
        LL mid = (lb + ub) >> 1;
        if(Judge(mid)) lb = mid + 1, res = mid;
        else ub = mid - 1;
    }

    return res;
}

inline bool Judge1(LL x)
{
    int v = upper_bound(A, A+n, x) - A;
    LL cnt = sum[n-1] - sum[v-1] - x * (n - v);

    if(cnt > k) return false;
    return true;
}

LL solve_max()
{
    LL res = M;
    LL lb = (sum[n-1] + n - 1) / n, ub = M;
    while(lb <= ub)
    {
        LL mid = (lb + ub) >> 1;
        if(Judge1(mid)) ub = mid - 1, res = mid;
        else lb = mid + 1;
    }

    return res;
}

int main()
{
//  freopen("in.txt", "r", stdin);

    cin >> n >> k;
    for(int i = 0; i < n; i++)
        scanf("%I64d", &A[i]);
    sort(A, A + n);

//  for(int i = 0; i < n; i++)
//      cout << A[i] << endl;

    sum[0] = A[0];
    M = 0, m = inf;
    for(int i = 0; i < n; i++)
    {
        if(i > 0) sum[i] = sum[i-1] + A[i];
        M = max(A[i], M);
        m = min(A[i], m);
    }
    LL lb = solve_min();
    LL ub = solve_max();

//  cout << ub << " " << lb << endl;

    cout << ub - lb << endl;

    return 0;
}