020.自定义排序规则对结构体数组进行排序(以学生信息为例)

#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

typedef struct Student
{
	char id[15];//15位学号
	int score;//某科课程分数
}stu;

//定义排序规则
bool cmp(Student a, Student b)
{
	if (a.score != b.score)
	{
		return a.score > b.score;//如果成绩不相等那么按照由大到小的顺序排序
	}
	else
	{
		return strcmp(a.id, b.id)<0;//否则按照准考证号由小到大排序
	}
}

int main()
{
	stu student[5];
	for (int i = 0; i < 5; i++)
	{
		cin >> student[i].id >> student[i].score;
	}
	sort(student,student+5, cmp);
	for (int i = 0; i < 5; i++)
	{
		cout << student[i].id <<" "<< student[i].score<<endl;
	}
	system("pause");
	return 0;
}