1028 List Sorting

最新推荐文章于 2020-10-18 15:24:25 发布

原创最新推荐文章于 2020-10-18 15:24:25 发布 · 155 阅读

0 ·

CC 4.0 BY-SA版权

pat 专栏收录该内容

71 篇文章

订阅专栏

本文介绍了一个基于学生记录的排序算法，该算法可以根据ID、姓名或成绩进行升序或非递减排序。通过定义不同的比较函数，实现了灵活的排序功能。

1028 List Sorting （25 分)

Excel can sort records according to any column. Now you are supposed to imitate this function.

Input Specification:

Each input file contains one test case. For each case, the first line contains two integers N (≤105) and C, where N is the number of records and C is the column that you are supposed to sort the records with. Then N lines follow, each contains a record of a student. A student's record consists of his or her distinct ID (a 6-digit number), name (a string with no more than 8 characters without space), and grade (an integer between 0 and 100, inclusive).

Output Specification:

For each test case, output the sorting result in N lines. That is, if C = 1 then the records must be sorted in increasing order according to ID's; if C = 2 then the records must be sorted in non-decreasing order according to names; and if C = 3 then the records must be sorted in non-decreasing order according to grades. If there are several students who have the same name or grade, they must be sorted according to their ID's in increasing order.

Sample Input 1:

3 1
000007 James 85
000010 Amy 90
000001 Zoe 60

Sample Output 1:

000001 Zoe 60
000007 James 85
000010 Amy 90

Sample Input 2:

4 2
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 98

Sample Output 2:

000010 Amy 90
000002 James 98
000007 James 85
000001 Zoe 60

Sample Input 3:

4 3
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 90

Sample Output 3:

000001 Zoe 60
000007 James 85
000002 James 90
000010 Amy 90

#include<bits/stdc++.h>
using namespace std;

#define e exp(1)
#define pi acos(-1)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
#define mem(a,b) memset(a,b,sizeof(a))
int gcd(int a,int b){return b?gcd(b,a%b):a;}

const int maxn=100005;
struct student{
	string id,name;
	int grade;
}s[maxn];
int n,c;

int cmp1(student a,student b)
{
	return a.id<b.id;
}
int cmp2(student a,student b)
{
	if(a.name!=b.name)return a.name<b.name;
	return a.id<b.id;
}
int cmp3(student a,student b)
{
	if(a.grade!=b.grade)return a.grade<b.grade;
	return a.id<b.id;
}
int main()
{
	ios::sync_with_stdio(false);
	cin>>n>>c;
	for(int i=0; i<n; i++)
	{
		cin>>s[i].id>>s[i].name>>s[i].grade;
	}
	if(c==1)
	{
		sort(s,s+n,cmp1);
	}
	else if(c==2)
	{
		sort(s,s+n,cmp2);
	}
	else sort(s,s+n,cmp3);
	for(int i=0; i<n; i++)
	{
		cout<<s[i].id<<" "<<s[i].name<<" "<<s[i].grade<<'\n';
	}
	return 0;
}