1178 questions of Olympiad in informatics -- ranking of grades

【 Title Description 】

Give the transcript of a course in the class , Please sort your transcripts from high to low , If you have the same score, the smaller one in the name dictionary comes first .

【 Input 】

First act n (0 < n < 20), Indicates the number of students in the class ;

Next n That's ok , Each behavior, each student's name and his grades , Separate them with a single space . The name contains only letters and is no longer than 20, The score is no more than 100 Non-negative integer .

【 Output 】

Sort the transcripts from high to low and output them , Each line contains two items: name and score , There is a space between .

【 sample input 】

4
Kitty 80
Hanmeimei 90
Joey 92
Tim 

【 sample output 】

Joey 92
Hanmeimei 90 
Kitty 80
Tim 28

---

Examine the subject ：

1. Everyone has a name and grades , So use a structure
2. The name is string type

Ideas ：

There are two kinds of sorting rules , First, different grades , In descending order of grades ; Second, the results are the same , Descending by name （ Dictionary order ）

Code ：

#include<bits/stdc++.h>
using namespace std;
const int N=25;
struct node{
	string name;
	int score;
}a[N];
bool cmp(node x,node y)
{
	if(x.score==y.score) return x.name<y.name;
	return x.score>y.score;
}
int n;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].name>>a[i].score;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++)
	{
		cout<<a[i].name<<" "<<a[i].score<<endl;
	}
	return 0;
}