CF 379C New Year Ratings Change

先根据rate排序，去重，注意可能前面去重后的结果影响到后面的值，因此WA了一次。然后在按序列排序回来。

#include<iostream>
#include<algorithm>
using namespace std;


int n;
struct dd{
	int num;
	int val;
}dad[300001];

bool cmp1(struct dd a,struct dd b){
	return a.val<b.val?1:0;
}

bool cmp2(struct dd a,struct dd b){
	return a.num<b.num?1:0;
}

int main(){
	cin>>n;
	for(int i = 0; i < n; i++){
		cin>>dad[i].val;
		dad[i].num = i;
	}
	sort(dad,dad+n,cmp1);
	int tt = 0;
	int cc = 1;
	for(int i = 0; i < n; i++){
		if(tt!=dad[i].val){
			if(dad[i].val <= dad[i-1].val)
				tt=dad[i].val=dad[i-1].val+1;
			else
				tt=dad[i].val;
			cc=1;
			continue;
		}
		dad[i].val = tt + (cc++);
	}
	sort(dad,dad+n,cmp2);
	for(int i = 0; i < n; i++){
		cout<<dad[i].val;
		if(i!=n-1) cout<<" ";
	}
	cout<<endl;
	return 0;
}