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
/*
Name:
Copyright:
Author: 流照君
Date: 2019/8/14 14:46:37
Description:
*/
#include <iostream>
#include<string>
#include <algorithm>
#include <vector>
#define inf 100100
using namespace std;
typedef long long ll;
struct student{
int sno;
string name;
int score;
};
student s[inf];
bool cmp1(student a,student b)
{
return a.sno<b.sno;
}
bool cmp2(student a,student b)
{
if(a.name!=b.name)
return a.name<b.name;
else
return a.sno<b.sno;
}
bool cmp3(student a,student b)
{
if(a.score!=b.score)
return a.score<b.score;
else
return a.sno<b.sno;
}
int main(int argc, char** argv)
{
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
int n,c;
cin>>n>>c;
for(int i=0;i<n;i++)
cin>>s[i].sno>>s[i].name>>s[i].score;
if(c==1)
{
sort(s,s+n,cmp1);
}
else if(c==2)
{
sort(s,s+n,cmp2);
}
else if(c==3)
{
sort(s,s+n,cmp3);
}
for(int i=0;i<n;i++)
{
printf("%06d ",s[i].sno);
cout<<s[i].name<<" ";
printf("%d",s[i].score);
printf("
");
}
return 0;
}
很简单结构体排序，重写cmp就行