Excel can sort records according to any column. Now you are supposed to imitate this function.
Input
Each input file contains one test case. For each case, the first line contains two integers N (<=100000) 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
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
|
1 2 3 4 |
3 1 000007 James 85 000010 Amy 90 000001 Zoe 60 |
Sample Output 1
|
1 2 3 |
000001 Zoe 60 000007 James 85 000010 Amy 90 |
Sample Input 2
|
1 2 3 4 5 |
4 2 000007 James 85 000010 Amy 90 000001 Zoe 60 000002 James 98 |
Sample Output 2
|
1 2 3 4 |
000010 Amy 90 000002 James 98 000007 James 85 000001 Zoe 60 |
Sample Input 3
|
1 2 3 4 5 |
4 3 000007 James 85 000010 Amy 90 000001 Zoe 60 000002 James 90 |
Sample Output 3
|
1 2 3 4 |
000001 Zoe 60 000007 James 85 000002 James 90 000010 Amy 90 |
水题一道，也忘了是什么时候做的了……
写三个 compare 函数，然后 qsort ……
代码如下：
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 |
#include<stdio.h> #include<stdlib.h> #include<string.h> typedef struct list_ { char name[9]; int id; int grade; } list; int compare_grade(const void *a,const void *b) { if(((list *)a)->grade<((list *)b)->grade) { return -1; } if(((list *)a)->grade>((list *)b)->grade) { return 1; } return ((list *)a)->id-((list *)b)->id; } int compare_name(const void *a,const void *b) { if(!strcmp(((list *)a)->name,((list *)b)->name)) { return ((list *)a)->id-((list *)b)->id; } return strcmp(((list *)a)->name,((list *)b)->name); } int compare_id(const void *a,const void *b) { return ((list *)a)->id-((list *)b)->id; } int main() { int i,n,c; int (*compare)(); list *student; scanf("%d%d",&n,&c); student=(list *)malloc(n*sizeof(list)); for(i=0;i<n;i++) { scanf("%d%s%d",&(student[i].id),student[i].name,&(student[i].grade)); } switch(c) { case 1: compare=compare_id; break; case 2: compare=compare_name; break; case 3: compare=compare_grade; break; } qsort(student,n,sizeof(list),compare); for(i=0;i<n;i++) { printf("%06d %s %d\n",student[i].id,student[i].name,student[i].grade); } } |