ABC 429 D 求调

#include <bits/stdc++.h>
using namespace std;
#define ll long long
map<float,ll> shu;
float wei1[500005],wei[500005];
bool cmp(float a,float b){
	return a>b;
}
ll jin(float a){
	return ceil(a-0.5);
}
ll n,m,c,ans,flag,flagg=2,gg=1,dianshu; 
int main(){
	cin >> n >> m >> c;
	for(int i=1;i<=n;i++){
		cin >> wei1[i];
		shu[wei1[i]]++;
	}
	sort(wei1+1,wei1+n+1);
	for(int i=n;i>=2;i--){
		if(wei1[i]==wei1[i-1]) wei1[i]=0;
	}
	wei[1]=wei1[1];
	for(int i=2;i<=n;i++){
		if(wei1[i]==0) continue;
		gg++;
		wei[gg]=wei1[i];
	}
	sort(wei+1,wei+gg+1,cmp);//无重复元素wei
	flag+=shu[wei[1]]; 
	for(int i=1;i<=gg;i++){
		ll sum=jin(wei[i])-jin(wei[i+1]);
		if(i==gg) sum=m-dianshu;
		dianshu+=sum;
		if(i!=1) flag-=shu[wei[i-1]];
		while(flag<c){
			int k;
			if(flagg%gg==0) k=gg;
			else k=flagg%gg;
			flag+=shu[wei[k]];
			flagg++;
		}
		ans+=sum*flag;
	}
	cout << ans; 
	return 0;
}