PAT 1036. Boys vs Girls (25)
来源:互联网 发布:气动打标机软件下载 编辑:程序博客网 时间:2024/05/16 10:57
1036. Boys vs Girls (25)
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:
3Joe M Math990112 89Mike M CS991301 100Mary F EE990830 95Sample Output 1:
Mary EE990830Joe Math9901126Sample Input 2:
1Jean M AA980920 60Sample Output 2:
AbsentJean AA980920NA
这道题用map的隐含排序即可解决,代码如下:
#include <iostream>#include <string>#include <iomanip>#include <map>#include <vector>#include <cstring>using namespace std;typedef struct student{string name;string ID;}student;int main(void){int N;cin>>N;map<int,student> male;map<int,student,greater<int> > female;while(N--){string n,g,i;int grade;cin>>n>>g>>i>>grade;if(g=="M"){student temp;temp.name=n;temp.ID=i;male[grade]=temp;}else{student temp;temp.name=n;temp.ID=i;female[grade]=temp;}}int flag=0,max,min;if(female.size()==0){cout<<"Absent"<<endl;flag=1;}else{cout<<female.begin()->second.name<<" "<<female.begin()->second.ID<<endl;max=female.begin()->first;}if(male.size()==0){cout<<"Absent"<<endl;flag=1;}else{cout<<male.begin()->second.name<<" "<<male.begin()->second.ID<<endl;min=male.begin()->first;}if(flag==1)cout<<"NA";elsecout<<max-min;}
- 1036. Boys vs Girls (25)-PAT
- 【PAT】1036. Boys vs Girls (25)
- PAT 1036. Boys vs Girls (25)
- PAT A 1036. Boys vs Girls (25)
- PAT 1036. Boys vs Girls (25)
- pat 1036. Boys vs Girls (25)
- PAT 1036. Boys vs Girls (25)
- PAT甲级.1036. Boys vs Girls (25)
- 1036. Boys vs Girls (25) PAT 甲级
- 【PAT甲级】1036. Boys vs Girls (25)
- PAT A 1036. Boys vs Girls (25)
- PAT-A 1036. Boys vs Girls (25)
- PAT甲级1036. Boys vs Girls (25)
- PAT-A-1036. Boys vs Girls (25)
- PAT 甲级 1036. Boys vs Girls (25)
- PAT甲级 1036. Boys vs Girls (25)
- PAT刷题:1036. Boys vs Girls (25)
- 【PAT】1036. Boys vs Girls
- bfprt算法
- poj3465 贪心+优先队列
- coj 1268:Pingpang Balls
- Ajax 发请求扩展
- NSDictionary 字典
- PAT 1036. Boys vs Girls (25)
- iOS_第三方字体的导入和使用
- 数据结构概述
- 红拂夜奔
- 交换两个值的方法
- Volley网络框架完全解析(实战篇)
- Openerp权限设置总结
- 邮差总按两次铃
- 解决eclipse不能