1028 List Sorting (25 分)

1028 List Sorting (25 分)

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 9

Sample Output 3:

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

解释

模拟excel排序

输入 N，C

接下来输入N条学生信息，包括ID name grade

C=1 按ID 增序

C=2 按name 非递减(增序),name 相同，按ID升序

C=3 按 grade 增序，分数相同按ID升序

#include<iostream>
#include<string.h>
#include<string>
#include<algorithm>
#include<stdio.h>
using namespace std;
//学生结构体
typedef struct student
{
    int ID;
    string name;
    int grade;
}ST;
ST s[100010];
//ID
bool cmp1(ST a,ST b)
{
    return a.ID<b.ID;
}
//name
bool cmp2(ST a,ST b)
{
    int s=strcmp(a.name.data(),b.name.data());
    if(s!=0)
        return s<0;
    else
        return a.ID<b.ID;
}
// grade
bool cmp3(ST a,ST b)
{
    if(a.grade!=b.grade)
        return a.grade<b.grade;
    else
        return a.ID<b.ID;
}
int main()
{
    int N,mode;
    cin>>N>>mode;
    for(int i=0;i<N;i++)
        cin>>s[i].ID>>s[i].name>>s[i].grade;
    if(mode==1)//学号
        sort(s,s+N,cmp1);
    else if(mode==2)//姓名
        sort(s,s+N,cmp2);
    else if(mode==3)//分数
        sort(s,s+N,cmp3);
    for(int i=0;i<N;i++)
    {
        printf("%06d",s[i].ID);
        cout<<" "<<s[i].name<<" "<<s[i].grade<<endl;
    }
    return 0;
}