1028

最新推荐文章于 2024-02-26 18:08:47 发布

zhuqi12580

最新推荐文章于 2024-02-26 18:08:47 发布

阅读量579

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/zhuqi12580/article/details/8668196

版权

PAT 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100000;

struct Student
{
	char id[7];
	char name[9];
	int score;
};
Student stu[N];
bool AscById(Student a, Student b)
{
	return strcmp(a.id, b.id)<0;
}
bool AscByName(Student a, Student b)
{
	if(strcmp(a.name, b.name) ==0)
		return strcmp(a.id, b.id)<0;
	else
		return strcmp(a.name, b.name)<0;
}
bool AscByScore(Student a, Student b)
{
	if(a.score == b.score)
		return strcmp(a.id, b.id)<0;
	else
		return a.score<b.score;
}
int main()
{
	int count,type;
	scanf("%d%d", &count, &type);
	for(int i=0; i<count; ++i)
		scanf("%s%s%d", stu[i].id, stu[i].name, &stu[i].score);
	if(type==1)
		sort(stu, stu+count, AscById);
	else if(type==2)
		sort(stu, stu+count, AscByName);
	else
		sort(stu, stu+count, AscByScore);
	for(int i=0; i<count; ++i)
		printf("%s %s %d\n", stu[i].id, stu[i].name, stu[i].score);
	return 0;
}