题目:
分析:一道排序题,结构体配合sort,完美实现各种排序。不知道哪错了,感觉没太大意义,不去深究了。
代码:
#include<bits/stdc++.h>
using namespace std;
struct node{
string name;
string zhiwei;
int banggong;
int grade;
int num;
} n[110];
bool cmp(struct node x,struct node y){
if (x.banggong != y.banggong) return x.banggong > y.banggong;
else return x.grade > y.grade;
}
bool cmp2(struct node x,struct node y){
if (x.grade != y.grade) return x.grade > y.grade;
else return x.num < y.num;
}
int m;
int main()
{
cin>>m;
string name2;
string zhiwei2;
int banggong2;
int grade2;
int c=0;
for(int i=0;i<m;i++)
{
cin>>name2>>zhiwei2>>banggong2>>grade2;
if(zhiwei2=="BangZhu"||zhiwei2=="FuBangZhu")
{
cout<<name2<<' '<<zhiwei2<<' '<<grade2<<endl;
continue;
}
n[c].name=name2;
n[c].zhiwei=zhiwei2;
n[c].banggong=banggong2;
n[c].grade=grade2;
n[c].num=i;
c++;
}
if(c==0)
{
return 0;
}
sort(n, n + c, cmp);
sort(n, n + min(c,2), cmp2);
int i=0;
for(;i<min(c,2);i++)
{
cout<<n[i].name<<' '<<"HuFa"<<' '<<n[i].grade<<endl;
}
if(c<=2) return 0;
sort(n + 2, n + min(c,6), cmp2);
for(;i<min(c,6);i++)
{
cout<<n[i].name<<' '<<"ZhangLao"<<' '<<n[i].grade<<endl;
}
if(c<=6) return 0;
sort(n + 6, n + min(c,13), cmp2);
for(;i<min(c,13);i++)
{
cout<<n[i].name<<' '<<"TangZhu"<<' '<<n[i].grade<<endl;
}
if(c<=13) return 0;
sort(n + 13, n + min(c,38), cmp2);
for(;i<min(c,38);i++)
{
cout<<n[i].name<<' '<<"JingYing"<<' '<<n[i].grade<<endl;
}
if(c<=38) return 0;
for(;i<c;i++)
{
cout<<n[i].name<<' '<<"BangZhong"<<' '<<n[i].grade<<endl;
}
}