2019nyist ccpc final资格选拔赛2 D. Equalize the Remainders 思维贪心模拟

题目链接：http://codeforces.com/problemset/problem/999/D

题意求使数组中所有元素除m的余数相同且等于n/m，的最少操作次数，每次操作可以为一个元素加1.

贪心模拟每个余数超过数量的先变成最近的不满足数量的余数；

ac代码：

#include<set>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const ll inf=0x3f3f3f3f;
const ll mx=2e5+10;
const ll mod=1e9+7;
ll a[mx], b[mx];
set<ll>se;
int main()
{
    ll q, n, m;
    scanf("%lld%lld", &n, &m);
    for (ll i = 0; i < n; ++i) {
        scanf("%lld", &a[i]);
        b[a[i]%m]++;
    }
    ll k = n/m, sum = 0;
    for (ll i = 0; i < m; ++i)
        if(b[i] < k) se.insert(i);
    for (ll i = 0; i < n; ++i) {
        if (b[a[i]%m] <= k) continue;
        b[a[i]%m]--;
        set<ll>::iterator x = se.lower_bound(a[i]%m);
        if (x != se.end()) {
            sum += *x-a[i]%m;
            a[i] += *x-a[i]%m;
            b[*x]++;
        }
        else {
            x = se.begin();
            sum += m-a[i]%m+*x;
            a[i] += m-a[i]%m+*x;
            b[*x]++;
        }
        if (b[*x] == k) se.erase(x);
    }
    printf("%lld\n%lld", sum, a[0]);
    for (ll i = 1; i < n; ++i) {
        printf(" %lld", a[i]);
    }
    puts("");
    return 0;
}