#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
struct Stu
{
char name[100];
int age;
int grade;
}student[10];
bool cmp(Stu a, Stu b)
{
if (a.grade != b.grade)
return a.grade < b.grade;    ----------成績高低
int temp = strcmp(a.name, b.name);
if (temp!=0)
{
return temp < 0;----------------姓名首字母靠前
}
else
{
return a.age < b.age;----------------年齡大小
}
}
void main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> student[i].name >> student[i].age >> student[i].grade;
sort(student, student+n, cmp);-----------使用快速排序演算法，引數分別為首地址，末地址，比較的定義
for (int i = 0; i < n; i++)
{
cout << student[i].name <<"\t"<< student[i].age<<"\t" << student[i].grade << endl;
}
system("pause");
}