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 (≤105) 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
// 解题思路:
// 直接按题意暴力就好,sort排序后输出
#include <bits/stdc++.h>
using namespace std;
typedef struct student
{
string id, name;
int grade;
}stu;
bool cmp1(stu &l, stu &r)
{
return l.id < r.id;
}
bool cmp2(stu &l, stu &r)
{
if(l.name != r.name)
return l.name < r.name;
else return l.id < r.id;
}
bool cmp3(stu &l, stu &r)
{
if(l.grade != r.grade)
return l.grade < r.grade;
else return l.id < r.id;
}
vector<stu> v;
int main()
{
// 关闭stdio同步,提高cin 和 cout 速度
ios::sync_with_stdio(false);
int n, c;
cin >> n >> c;
stu t;
for(int i = 1; i <= n;i++)
{
cin >> t.id >> t.name >> t.grade;
v.push_back(t);
}
switch (c)
{
case 1:
sort(v.begin(), v.end(), cmp1);
break;
case 2:
sort(v.begin(), v.end(), cmp2);
break;
case 3:
sort(v.begin(), v.end(), cmp3);
break;
default:
break;
}
for(int i = 0; i < v.size(); i++)
{
cout << v[i].id << " " << v[i].name << " " << v[i].grade << endl;
}
return 0;
}