PAT 1036. Boys vs Girls (25)
2015-08-15 15:57
405 查看
1036. Boys vs Girls (25)
时间限制400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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
这道题用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"; else cout<<max-min; }
相关文章推荐
- 图的最小生成树之普里姆Prim算法
- 暑假-最短路(Bellman-ford、spfa)-A - Arbitrage
- 邮差总按两次铃
- Volley网络框架完全解析(实战篇)
- 共享个地图控件的样式
- Java Web项目结构
- 共享个地图控件的样式
- coj 1268:Pingpang Balls
- Ajax 发请求扩展
- iOS_第三方字体的导入和使用
- H--(LightOJ -- 1008
- Bubble, Insertion, Selection, Quick and Heap Sort
- 红拂夜奔
- 交换两个值的方法
- Unity shader: Bank BRDF
- 如何使用ubuntu14.04中的分区工具
- 学习笔记 链表的创建和赋值
- 10.2-2 用单链表实现栈
- [bfs] poj 3669 Meteor Shower
- 栈和堆的区别