1028 List Sorting

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 (≤) 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

思路：

　　模拟，注意采用cin输入的话最后一组数据会被卡到。

Code：

#include <bits/stdc++.h>

using namespace std;

struct Stu {
    int id;
    char name[10];
    int grade;
} students[100005];

bool cmp1(Stu a, Stu b) { return a.id < b.id; }
bool cmp2(Stu a, Stu b) { return strcmp(a.name, b.name) <= 0; }
bool cmp3(Stu a, Stu b) { return a.grade <= b.grade; }

int main() {
    int n, c;
    scanf("%d%d", &n, &c);
    for (int i = 0; i < n; ++i)
        scanf("%d%s%d", &students[i].id, students[i].name, &students[i].grade);
    if (c == 1)
        sort(students, students + n, cmp1);
    else if (c == 2)
        sort(students, students + n, cmp2);
    else
        sort(students, students + n, cmp3);
    for (int i = 0; i < n; ++i)
        cout << setw(6) << setfill('0') << students[i].id << " "
             << students[i].name << " " << students[i].grade << endl;
    return 0;
}