1036 Boys vs Girls
2021/7/9 23:08:39
本文主要是介绍1036 Boys vs Girls,对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
题目来源:PAT (Advanced Level) Practice
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 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
words:
male 男性的 female 女性的 distinct 明显的,有区别的
思路:
1. 根据题目给出的 n 个学生的信息----姓名,性别,ID,成绩;找出女生中成绩最高的学生在第一行输出姓名和ID,不存在则输出Absent;找出男生中成绩最低的学生在在第二行输出姓名和ID,不存在则输出Absent;在第三行输出女生最高成绩和男生最低成绩的成绩差,若有一者不存在则输出NA;
//PAT ad 1036 Boys vs Girls #include <iostream> using namespace std; struct student { string name; char gender; string id; int grade; }p[2]; int main() { int n,i; bool pm=false,pf=false; //最高分和最低分存在的标记 int mi=100,ma=0; string name; char gender; string id; int grade; cin>>n; for(i=0;i<n;i++) { cin>>name>>gender>>id>>grade; if(gender=='F'&&grade>ma) //女生中的最高分 { ma=grade;pf=true; p[0].name=name;p[0].gender=gender;p[0].id=id;p[0].grade=grade; } else if(gender=='M'&&grade<mi) //男生中的最低分 { mi=grade;pm=true; p[1].name=name;p[1].gender=gender;p[1].id=id;p[1].grade=grade; } } if(pf) cout<<p[0].name<<" "<<p[0].id<<endl; //最高分存在 else cout<<"Absent"<<endl; if(pm) cout<<p[1].name<<" "<<p[1].id<<endl; //最低分存在 else cout<<"Absent"<<endl; if(pf&&pm) cout<<p[0].grade-p[1].grade<<endl; //最高分和最低分都存在 else cout<<"NA"<<endl; return 0; }
这篇关于1036 Boys vs Girls的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-11-27消息中间件底层原理资料详解
- 2024-11-27RocketMQ底层原理资料详解:新手入门教程
- 2024-11-27MQ底层原理资料详解:新手入门教程
- 2024-11-27MQ项目开发资料入门教程
- 2024-11-27RocketMQ源码资料详解:新手入门教程
- 2024-11-27本地多文件上传简易教程
- 2024-11-26消息中间件源码剖析教程
- 2024-11-26JAVA语音识别项目资料的收集与应用
- 2024-11-26Java语音识别项目资料:入门级教程与实战指南
- 2024-11-26SpringAI:Java 开发的智能新利器