#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct students{
long long sc;
string num,name;
}s[100005];
bool cmp1(const students &a,const students &b)
{
return a.num<b.num;
}
bool cmp2(const students &a,const students &b)
{
if(a.name==b.name)
return a.num<b.num;
return a.name<b.name;
}
bool cmp3(const students &a,const students &b)
{
if(a.sc==b.sc)
return a.num<b.num;
return a.sc<b.sc;
}
int n,c;
int main()
{
cin>>n>>c;
for(int i=1;i<=n;i++)
cin>>s[i].num>>s[i].name>>s[i].sc;
if(c==1)
sort(s+1,s+1+n,cmp1);
if(c==2)
sort(s+1,s+1+n,cmp2);
if(c==3)
sort(s+1,s+1+n,cmp3);
for(int i=1;i<=n;i++)
cout<<s[i].num<<' '<<s[i].name<<' '<<s[i].sc<<endl;
return 0;
}
7-18 模拟EXCEL排序
最新推荐文章于 2022-09-24 15:53:42 发布