PAT 甲级 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 (≤$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 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

翻译

类似excel排序

代码

#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int n,c;
struct student
{
    char name[10];
    int grade,id;
};
student stu[100001];

bool cmp(student a,student b)
{
    switch (c)
    {
    case 1:
        return a.id<b.id;
        break;
    case 2:
        if(strcmp(a.name,b.name)==0) return a.id<b.id;
        return strcmp(a.name, b.name) <= 0;
        break;
    case 3:
        if(a.grade==b.grade) return a.id<b.id;
        return a.grade<b.grade;
        break;
    default:
        break;
    }
}
int main()
{
    scanf("%d %d",&n,&c);
    for(int i=0;i<n;i++)
    {
        scanf("%d %s %d",&stu[i].id,&stu[i].name,&stu[i].grade);
        // cin>>stu[i].id>>stu[i].name>>stu[i].grade;
    }
    sort(stu,stu+n,cmp);
    for(int i=0;i<n;i++)
    {
        printf("%06d %s %d\n",stu[i].id,stu[i].name,stu[i].grade);
        // cout<<stu[i].id<<" "<<stu[i].name<<" "<<stu[i].grade<<endl;
    }
    system("pause");
}

思路

一道排序题，很简单。
注意使用scanf和printf输入输出，否则会超时。