pat甲级1028

最新推荐文章于 2022-04-23 17:22:01 发布

altman_dior

最新推荐文章于 2022-04-23 17:22:01 发布

阅读量299

点赞数

分类专栏： PPAT 文章标签： PAT

本文链接：https://blog.csdn.net/altman_dior/article/details/52971000

版权

PPAT 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

1028. List Sorting (25)

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

Input

Each input file contains one test case. For each case, the first line contains two integers N (<=100000) 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).

输入第一行有两个整数N (<=100000)和C，N是数据的个数，C代表你要通过第几列来对数据排序。然后是N行，每一行是一个学生的数据。一个学生的数据包括他的ID（6位），名字（不超过8个字符且没有空格的字符串），分数（0~100间的整数）。

Output

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.

输出N行排序结果。如果C==1，数据通过ID升序排序；如果C==2，数据通过姓名不降序排序；如果C==3，数据通过成绩不降序排序。如果有一些学生名字或成绩一样，通过ID升序排序输出。

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<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn=100005;
struct Student
{
	int id;
	char name[10];
	int grade;
}student[maxn];
int c;
int cmp1(Student a,Student b)
{
	if(c==1)
		return a.id<b.id;
	else if(c==2)
	{
		if(strcmp(a.name,b.name)==0)
			return a.id<b.id;
		return strcmp(a.name,b.name)<0;
	}
	else if(c==3)
	{
		if(a.grade==b.grade)
			return a.id<b.id;
		return a.grade<b.grade;

	}
}
int main()
{
	int n;
	scanf("%d%d",&n,&c);
	for(int i=0;i<n;i++)
	{
		scanf("%d %s %d",&student[i].id,student[i].name,&student[i].grade);
	}
	sort(student,student+n,cmp1);
	for(int i=0;i<n;i++)
	{
		printf("%06d %s %d\n",student[i].id,student[i].name,student[i].grade);
	}
	//system("pause");
	return 0;
}