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 (≤105) 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 9
Sample Output 3:
000002 James 9
000001 Zoe 60
000007 James 85
000010 Amy 90
代码
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct Student
{
string id;
string name;
int grade;
};
vector<Student> students;
bool cmp1(Student a, Student b)
{
return a.id < b.id;
}
bool cmp2(Student a, Student b)
{
if(a.name != b.name) return a.name < b.name;
return a.id < b.id;
}
bool cmp3(Student a, Student b)
{
if(a.grade != b.grade) return a.grade < b.grade;
return a.id < b.id;
}
int main()
{
int N, C;
scanf("%d%d", &N, &C);
char id[10];
char name[10];
for(int i = 0; i < N; i++)
{
int grade;
scanf("%s%s%d", id, name, &grade);
students.push_back({id, name, grade});
}
switch(C)
{
case 1:{
sort(students.begin(), students.end(), cmp1);
break;
}
case 2:{
sort(students.begin(), students.end(), cmp2);
break;
}
case 3:{
sort(students.begin(), students.end(), cmp3);
break;
}
}
for(auto &item : students)
{
printf("%s %s %d\n", item.id.c_str(), item.name.c_str(), item.grade);
}
return 0;
}
总结
1. 比较函数的编写与使用
2. 输入规模大于10^5时,就采用scanf方式,提高速度