PTA甲级 1036 Boys vs Girls (25point(s))

本文介绍了一种算法,用于分析学生考试成绩中男女生之间的差异,通过比较最低男性分数和最高女性分数及其差值,展示了如何从输入文件中读取学生信息,并使用C++进行数据处理和结果输出。

摘要生成于 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 name and 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 grade​F−grade​M。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<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
struct node{
string name;
string sto;
int grade;
};
vector<node>m,f;
bool cmp(node &a,node &b){
    return a.grade<b.grade;
}
int main(){
    node temp;
char flag;
int n;
cin>>n;
for(int i=0;i<n;i++){

cin>>temp.name>>flag>>temp.sto>>temp.grade;
if(flag=='M'){
m.push_back(temp);
}
else{
    f.push_back(temp);
}
}
sort(m.begin(),m.end(),cmp);
sort(f.begin(),f.end(),cmp);
if(f.size()==0){
    cout<<"Absent"<<endl;
}
else{
    cout<<f[f.size()-1].name<<" "<<f[f.size()-1].sto<<endl;
}
if(m.size()==0){
    cout<<"Absent"<<endl;
}
else{
    cout<<m[0].name<<" "<<m[0].sto<<endl;
}
if(m.size()==0||f.size()==0){
    cout<<"NA";
}
else{
    cout<<abs(m[0].grade-f[f.size()-1].grade);
}
system("pause");
return 0;

}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值