pat

题目

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 (≤10^5)$ 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 Input1:

3 1
000007 James 85
000010 Amy 90
000001 Zoe 60

Sample Output1:

000001 Zoe 60
000007 James 85
000010 Amy 90

Sample Input2:

4 2
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 98

Sample Output2:

000010 Amy 90
000002 James 98
000007 James 85
000001 Zoe 60

Sample Input3:

4 3
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 90

Sample Output3:

000001 Zoe 60
000007 James 85
000002 James 90
000010 Amy 90

水题。

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

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
struct {
  int id, grade;
  string name;
  Node(int ID, string str, int Grade){
      id = ID;
      name = str;
      grade = Grade;
  }
};
bool cmp1(Node a, Node b){ return a.id < b.id; }
bool cmp2(Node a, Node b){ return a.name <= b.name; }
bool cmp3(Node a, Node b){ return a.grade <= b.grade; }
int main(){
    int N, C, tid, tgrade;
    vector<Node> V;
    string ts;
    scanf("%d %d", &N, &C);
    for(int i = 0;i < N;i++){
        cin >> tid >> ts >> tgrade;
        Node node(tid, ts, tgrade);
        V.push_back(node);
    }
    if(C == 1) sort(V.begin(), V.end(), cmp1);
    else if(C == 2) sort(V.begin(), V.end(), cmp2);
    else sort(V.begin(), V.end(), cmp3);
    for(int i = 0;i < N;i++){
        printf("%06d ", V[i].id);
  cout << V[i].name;
   printf(" %dn", V[i].grade);
    }
    return 0;
}