PAT_A1028#List Sorting

Source:

PAT A1028 List Sorting (25 分)

Description:

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 (≤) 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

Keys:

• 模拟题

Code:

 /*
 Data: 2019-07-17 18:40:30
 Problem: PAT_A1028#List Sorting
 AC: 12:22

 题目大意：
 排序
 输入：
 第一行给出，记录数N<=1e5，排序规则C
 接下来N行，id，name，grade
 C=1，id递增
 C=2，name递增+id递增
 C=3，grade递增+id递增
 */

 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 using namespace std;
 const int M=1e5+,N=;
 struct node
 {
     char name[N];
     int id,grade;
 }info[M];

 bool cmp_name(const node &a, const node &b)
 {
     return strcmp(a.name,b.name) < ;
 }

 bool cmp_grade(const node &a, const node &b)
 {
     return a.grade < b.grade;
 }

 bool cmp_id(const node &a, const node &b)
 {
     return a.id < b.id;
 }

 int main()
 {
 #ifdef    ONLINE_JUDGE
 #else
     freopen("Test.txt", "r", stdin);
 #endif

     int n,c;
     scanf("%d%d", &n,&c);
     for(int i=; i<n; i++)
         scanf("%d %s %d\n", &info[i].id,info[i].name,&info[i].grade);
     sort(info,info+n,cmp_id);
     if(c==)
         sort(info,info+n,cmp_name);
     if(c==)
         sort(info,info+n,cmp_grade);
     for(int i=; i<n; i++)
         printf("%06d %s %d\n", info[i].id,info[i].name,info[i].grade);

     return ;
 }