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
代码
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<set>
#include<queue>
using namespace std;
typedef struct node{
int id;
char s[10];
int sc;
}nn;
const int maxn = 1e5 + 10;
nn a[maxn];
int c;
bool cmp(nn n1, nn n2){
if (c == 1) {
return n1.id < n2.id;
} else if (c == 2) {
if (strcmp(n1.s, n2.s) == 0) {
return n1.id < n2.id;
} else {
return strcmp(n1.s, n2.s) < 0;
}
} else {
if (n1.sc == n2.sc) {
return n1.id < n2.id;
} else {
return n1.sc < n2.sc;
}
}
}
int main(){
int n;
scanf("%d%d", &n, &c);
for (int i = 0; i < n; i++) {
scanf("%d%s%d", &a[i].id, a[i].s, &a[i].sc);
}
sort(a, a+n, cmp);
for (int i = 0; i < n; i++) {
printf("%06d %s %d\n", a[i].id, a[i].s, a[i].sc);
}
return 0;
}