http://pat.zju.edu.cn/contests/pat-practise/1028

 

1028. List Sorting (25)

时间限制

200 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

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

return strcmp(a, b)<0;

[cpp]  view plain copy

1. #include <iostream>  
2. #include <string>  
3. #include <algorithm>  
4. #include <memory.h>  
5. #include <cstdio>  
6. #include <cstdlib>  
7. #include <queue>  
8. #include <vector>  
9. using namespace std;  
10. #define MAX 0Xfffffff  
11.   
12. int c;  
13. struct Node{  
14.     char id[10];  
15.     int grade;  
16.     char name[14];  
17.     bool operator<(const Node& node)const{  
18.         if(c==1){  
19.             return strcmp(id, node.id)<0;  
20.         }else if(c==2){  
21.             if(strcmp(name, node.name))  
22.                 return strcmp(name, node.name)<0;  
23.             return strcmp(id, node.id)<0;  
24.         }else{  
25.             if(grade!=node.grade)  
26.                 return grade<node.grade;  
27.             return strcmp(id, node.id)<0;  
28.         }  
29.     }  
30. };  
31. Node nodes[100001];  
32. int main(){  
33.   
34.    //freopen("in.txt", "r", stdin);  
35.     
36.    int n;  
37.    while(cin>>n>>c){  
38.        for(int i=0;i<n;++i){  
39.          scanf(" %s %s %d", nodes[i].id, nodes[i].name, &nodes[i].grade);  
40.        }  
41.         
42.        sort(nodes, nodes+n);  
43.        for(int i=0;i<n;++i){  
44.            printf("%s %s %d\n", nodes[i].id, nodes[i].name, nodes[i].grade);  
45.        }  
46.        
47.    }  
48.    //fclose(stdin);  
49. }