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 (≤10
5
) 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
using namespace std;
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cstring>
typedef struct Student
{
char ID[10];
char name[10];
int grade;
}Student;
Student S[100010] = {0};
int N = 0, C = 0;
bool cmp(Student A, Student B)
{
if(C == 1) return strcmp(A.ID, B.ID) < 0;//按ID升序
if(C == 2)//按name非降序
{
if(strcmp(A.name, B.name)) return strcmp(A.name, B.name) < 0;//两字符串相等时strcmp返回0
else return strcmp(A.ID, B.ID) < 0;//字典序小于返回值为负,否则为正
}
if(A.grade != B.grade) return A.grade < B.grade;//按成绩非降序
else strcmp(A.ID, B.ID) < 0;
}
int main()
{
scanf("%d %d", &N, &C);
for(int i=0; i<N; i++)
{
scanf("%s %s %d", S[i].ID, S[i].name, &S[i].grade);
}
sort(S, S+N, cmp);
for(int i=0; i<N; i++)
{
printf("%s %s %d\n", S[i].ID, S[i].name, S[i].grade);
}
return 0;
}