[ABC373E] How to Win the Election

#include<bits/stdc++.h>
#define int long long int
using namespace std;
struct A{
	int B,C;
}a[200010];
bool D(A E,A F){
	return E.C>F.C;
}
int b[200010],c[200010],k,m,n,x,y;
signed main(){
	ios::sync_with_stdio(0);
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++){
		a[i].B=i;
		cin>>a[i].C;
		k-=a[i].C;
	}
	stable_sort(a+1,a+n+1,D);
	for(int i=1;i<=n;i++) b[i]=a[i].C+b[i-1];
	for(int i=1;i<=n;i++){
		if(a[i].C<a[m].C){
			if(a[m].C-a[i].C>k) c[a[i].B]=-1;
			else c[a[i].B]=ceil((k-(a[m].C-a[i].C))/2.0)+(a[m].C-a[i].C);
		}
		else if(k<(a[i].C*(m-i+1)-(b[m+1]-b[i]))) c[a[i].B]=0;
		else c[a[i].B]=ceil((k-(a[i].C*(m-i+1)-(b[m+1]-b[i])))*1.0/(m-i+2));
	}
	for(int i=1;i<=n;i++) cout<<c[i]<<' ';
	cout<<'\n';
	return 0;
}