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 (≤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 90
Sample Output 3:
000001 Zoe 60
000007 James 85
000002 James 90
000010 Amy 90
题目大意:
模拟按列排序,给定n个记录以及c,其中c用来指定排那一列,均按照不减次序。
思路:
只需要在cmp函数稍微改下即可,注意当名字相同时,id小的优先,分数相同时id小的仍旧优先。
参考代码:
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
struct stu{
int id, scr;
char name[10];
};
int n, c;
vector<stu> student;
bool cmp(stu a, stu b){
if(c == 1) return a.id < b.id;
else if(c == 2){
if(strcmp(a.name, b.name) == 0) return a.id < b.id;
else return strcmp(a.name, b.name) <= 0;
}
else{
if(a.scr == b.scr) return a.id < b.id;
else return a.scr < b.scr;
}
}
int main(){
scanf("%d%d", &n, &c);
student.resize(n);
for(int i = 0; i < n; ++i)
scanf("%d %s %d", &student[i].id, student[i].name, &student[i].scr);
sort(student.begin(), student.end(), cmp);
for(int i = 0; i < student.size(); ++i)
printf("%06d %s %d\n", student[i].id, student[i].name, student[i].scr);
return 0;
}