03:成绩排序

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
struct stu{
	char s[100];
	int fs;
}xs[101];
int main()
{
	int n,l,p=0;
	cin>>n;
	for(int i=1;i<=n;i++)
	 {
	 scanf("%s%d",xs[i].s,&xs[i].fs);
	 }
	 for(int i=1;i<=n-1;i++)
	  {
	  	for(int j=i;j<=n;j++)
	  	 {
	  	 	if(xs[i].fs<xs[j].fs)
	  	 	 {
	  	 	 	swap(xs[i],xs[j]);
	  	 	 	continue;
				}
				if(xs[i].fs==xs[j].fs)
				 {
					 if(strcmp(xs[i].s,xs[j].s)>0)
					  {
					  	swap(xs[i],xs[j]);
					  }
						  }
					 }
	  }
	  for(int i=1;i<=n;i++)
	   {
	   	printf("%s %d\n",xs[i].s,xs[i].fs);
	   }
	   return 0;
}