1036 Boys vs Girls （25 分）

最新推荐文章于 2023-06-03 11:23:30 发布

原创最新推荐文章于 2023-06-03 11:23:30 发布 · 99 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种算法，用于分析学生数据库中男性和女性学生的最高和最低成绩，并计算两者之间的差距。输入包括学生姓名、性别、ID和成绩，输出则是成绩最高女性学生和成绩最低男性学生的详细信息及成绩差值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

This time you are asked to tell the difference between the lowest grade of all the male students and the highest grade of all the female students.

Input Specification:

Each input file contains one test case. Each case contains a positive integer N, followed by N lines of student information. Each line contains a student's name, gender, ID and grade, separated by a space, where nameand ID are strings of no more than 10 characters with no space, gender is either F (female) or M (male), and grade is an integer between 0 and 100. It is guaranteed that all the grades are distinct.

Output Specification:

For each test case, output in 3 lines. The first line gives the name and ID of the female student with the highest grade, and the second line gives that of the male student with the lowest grade. The third line gives the difference gradeF−gradeM. If one such kind of student is missing, output Absent in the corresponding line, and output NA in the third line instead.

Sample Input 1:

3
Joe M Math990112 89
Mike M CS991301 100
Mary F EE990830 95

Sample Output 1:

Mary EE990830
Joe Math990112
6

Sample Input 2:

1
Jean M AA980920 60

Sample Output 2:

Absent
Jean AA980920
NA

#include<bits/stdc++.h>
using namespace std;
struct node
{
string name;
char gender;
string id;
int grade;
};
bool cmp(const node &a,const node &b)
{
return a.grade>b.grade;
}
int main()
{
int n,maxn=0,minn=0,flag1=0,flag2=0;
cin>>n;
vector<node>v(n);
vector<node>f;
vector<node>m;
for(int i=0;i<n;i++)
{
cin>>v[i].name>>v[i].gender>>v[i].id>>v[i].grade;
if(v[i].gender=='F')
f.push_back(v[i]);
if(v[i].gender=='M')
m.push_back(v[i]);
}
sort(f.begin(),f.end(),cmp);
sort(m.begin(),m.end(),cmp);
if(f.size())
{
cout<<f[0].name<<" "<<f[0].id<<endl;
maxn=f[0].grade;
flag1=1;
}
else
cout<<"Absent"<<endl;
if(m.size())
{
cout<<m[m.size()-1].name<<" "<<m[m.size()-1].id<<endl;
minn=m[m.size()-1].grade;
flag2=1;
}
else
cout<<"Absent"<<endl;
if(flag1&&flag2)
cout<<maxn-minn;
else
cout<<"NA";
}