L2-027 名人堂与代金券 (25 分)

大水题
只要用一个变量记录前一个数的排名就好了
然后统计代金券是统计的全体的发放值，不是在前k名中统计

#include <iostream>
#include <algorithm>
#include <string>
#include <deque>
#include <cstring>
#include <queue>
#include <vector>
#include <cstdio>
using namespace std;
const int N = 1e4+7;
struct node{
	string name;
	int pat, score;
}E[N];
bool cmp(node a, node b){
	if(a.score != b.score) return a.score > b.score;
	else return a.name < b.name;
}
int main(){
	int n, g, k;
	string str;
	scanf("%d%d%d", &n, &g, &k);
	for(int i = 0; i < n; i++){
		cin>>E[i].name>>E[i].score;
		if(E[i].score >= g) E[i].pat = 50;
		else if(E[i].score >= 60) E[i].pat = 20;
		else E[i].pat = 0;
	}
	sort(E, E+n, cmp);
	int res = 0, rank;
	for(int i = 0; i < n; i++){
		res += E[i].pat;
	}
	cout<<res<<endl;
	for(int i = 0; i < n; i++){
		if(i==0 || E[i].score != E[i-1].score){
			rank = i+1;
			if(rank > k) break;
			cout<<i+1;
		}else cout<<rank;
		cout<<" "<<E[i].name<<" "<<E[i].score<<endl;
	}
	return 0;
}