1036. Boys vs Girls (25)

题目链接:<a target=_blank href="https://www.patest.cn/contests/pat-a-practise/1036" target="_blank">https://www.patest.cn/contests/pat-a-practise/1036</a>

#include <iostream>
#include <string>
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
#include <stack>
using namespace std;
struct Node
{
char name[11],id[11],sex;
int grade;
};
int main()
{
int n;
scanf("%d",&n);
vector<Node>male,female;
for (int i=0; i<n; ++i){
Node p;
scanf("%s %c %s %d",p.name,&p.sex,p.id,&p.grade);
if(p.sex=='M')
male.push_back(p);
else
female.push_back(p);
}
sort(male.begin(), male.end(), [](Node a,Node b){
return a.grade<b.grade;
});
sort(female.begin(),female.end(), [](Node a,Node b){
return a.grade>b.grade;
});
bool flag = false;
if(female.size())
printf("%s %s\n",female[0].name,female[0].id);
else{
printf("Absent\n");
flag = true;
}
if(male.size())
printf("%s %s\n",male[0].name,male[0].id);
else{
printf("Absent\n");
flag = true;
}
if(flag)
printf("NA\n");
else
printf("%d\n",female[0].grade-male[0].grade);
return 0;
}