题目链接:https://vjudge.net/contest/336720#problem/J
题意:给出一个序列A一共n个数,给出一个m是n的因子。每次可以进行一个操作,使得A【i】+1。求至少进行多少次操作可以满足序列A中每个元素%m后的序列恰好有n/m个【0~m-1】.
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<set>
#define ll long long
using namespace std;
ll n,m;
ll A[200010],re[200010];
set<ll> se;
int main()
{
scanf("%lld%lld",&n,&m);
for(ll i=1; i<=n; i++)
scanf("%lld",&A[i]);
for(ll i=0; i<m; i++)
se.insert(i);
ll ans=0;
for(ll i=1; i<=n; i++)
{
int d=A[i]%m,z;
if(d>*se.rbegin()) z=*se.begin();
else z=*se.lower_bound(d);
ans+=((z)-d+m)%m;
A[i]+=((z)-d+m)%m;
re[z]++;
if(re[z]==(n/m))
se.erase(z);
}
printf("%lld\n",ans);
for(ll i=1; i<=n; i++) printf("%lld%s",A[i],i==n?"\n":" ");
}