Pat(Advanced Level)Practice--1028(List Sorting)

最新推荐文章于 2022-02-22 22:05:49 发布

烟蓑雨笠

最新推荐文章于 2022-02-22 22:05:49 发布

阅读量917

点赞数

分类专栏： Advance Pat 文章标签： Advance Pat C++ 基础题 sort

本文链接：https://blog.csdn.net/cstopcoder/article/details/20829209

版权

Advance Pat 专栏收录该内容

99 篇文章 0 订阅

订阅专栏

Pat1028 代码

题目描述：

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).

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.

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

AC代码：

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#define MAX 100005

using namespace std;

typedef struct Student
{
	char ID[10];
	char name[10];
	int score;
}Stu;

bool cmp1(const Stu &s1,const Stu &s2)
{
	if(strcmp(s1.ID,s2.ID)<0)
		return true;
	else 
		return false;
}

bool cmp2(const Stu &s1,const Stu &s2)
{
	if(strcmp(s1.name,s2.name)<0)
		return true;
	else if(strcmp(s1.name,s2.name)==0&&strcmp(s1.ID,s2.ID)<0)
		return true;
	else
		return false;
}

bool cmp3(const Stu &s1,const Stu &s2)
{
	if(s1.score<s2.score)
		return true;
	else if(s1.score==s2.score&&strcmp(s1.ID,s2.ID)<0)
		return true;
	else 
		return false;
}

int main(int argc,char *argv[])
{
	int n,c;
	int i;
	Stu v[MAX];
	scanf("%d%d",&n,&c);
	for(i=0;i<n;i++)
		scanf("%s %s %d",v[i].ID,v[i].name,&v[i].score);
	if(c==1)
		sort(v,v+n,cmp1);
	else if(c==2)
		sort(v,v+n,cmp2);
	else
		sort(v,v+n,cmp3);
	for(i=0;i<n;i++)
		printf("%s %s %d\n",v[i].ID,v[i].name,v[i].score);
	return 0;
}

sort()排序的训练，没什么好说的，需要注意的一点是，如果用cin,cout输入输出则最后一个case超时。。。