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
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int n, m;
struct Student{
char num[8];
char name[10];
int grade;
};
bool cmp(Student s1, Student s2){
if(m == 1) return strcmp(s1.num,s2.num) < 0;
if(m==2 && strcmp(s1.name,s2.name)!=0) return strcmp(s1.name,s2.name) < 0;
if(m==2) return strcmp(s1.num,s2.num) < 0;
if(m==3 && s1.grade!=s2.grade) return s1.grade < s2.grade;
if(m==3) return strcmp(s1.num,s2.num) < 0;
}
int main(){
scanf("%d %d", &n, &m);
Student stu[n];
for(int i=0; i<n; i++){
scanf("%s %s %d", stu[i].num, stu[i].name, &stu[i].grade);
}
sort(stu, stu+n, cmp);
for(int i=0; i<n; i++){
printf("%s %s %d\n", stu[i].num, stu[i].name, stu[i].grade);
}
return 0;
}
这题真的有点太简单了,简单到刚经过上一题电话账单折磨的我都怀疑这是不是甲级题目,5分钟从头写到尾并且AC。没什么好说的,就是分三种情况用cmp函数排序。我看书上是写了三个cmp函数,我感觉大可不必,完全可以合并成一个cmp函数。