题目概述与分析:
排序,求女生最高分和男生最低分的分差。若有一方缺失则特殊处理。
//简单结构体排序
#include<bits/stdc++.h>
using namespace std;
struct girl
{
string name, id;
int score;
}girls[10010];
struct boy
{
string name, id;
int score;
}boys[10010];
bool cmp1(girl a, girl b)
{
return a.score > b.score;
}
bool cmp2(boy a, boy b)
{
return a.score < b.score;
}
int main()
{
int n;
cin >> n;
int cnt1 = 0, cnt2 = 0;
string _name, _gender, _id;
int _score;
for(int i = 0; i < n; i++)
{
cin >> _name >> _gender >> _id >> _score;
if(_gender == "F")
{
girls[cnt1].name = _name;
girls[cnt1].id = _id;
girls[cnt1].score = _score;
cnt1++;
}
if(_gender == "M")
{
boys[cnt2].name = _name;
boys[cnt2].id = _id;
boys[cnt2].score = _score;
cnt2++;
}
}
sort(girls, girls + cnt1, cmp1);
sort(boys, boys + cnt2, cmp2);
int flag = 0;
if(cnt1 == 0)
{
cout << "Absent" << endl;
flag = 1;
}
else cout << girls[0].name << " " << girls[0].id << endl;
if(cnt2 == 0)
{
cout << "Absent" << endl;
flag = 1;
}
else cout << boys[0].name << " " << boys[0].id << endl;
if(flag == 1) cout << "NA" << endl;
else cout << girls[0].score - boys[0].score << endl;
return 0;
}
总结:
无需赘述。