# 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 namegenderID 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

### 解题思路：

map迭代器：map<int,Student>::iterator it;

### 代码如下：

#include<iostream>
#include<map>
using namespace std;
struct Student{
string name,id;
};
int N;
bool flag = true;//标记是否结果为NA
map<int,Student> male;
map<int,Student> female;
map<int,Student>::iterator it;
int main(){
scanf("%d",&N);
while(N--){
Student s;
string sex;
int score;
cin>>s.name>>sex>>s.id>>score;
if(sex == "M")
male.insert(pair<int,Student>(score,s));
else
female.insert(pair<int,Student>(score,s));
}
int a = 0,b = 0;
if(female.size() == 0){
printf("Absent\n");
flag = false;
}else{
it = female.end();
it --;
cout<<(it->second).name<<" "<<(it->second).id<<endl;
a = it->first;
}
if(male.size() == 0){
printf("Absent\n");
flag = false;
}else{
it = male.begin();
cout<<(it->second).name<<" "<<(it->second).id<<endl;
b = it->first;
}
if(flag == false)
printf("NA");
else
printf("%d",a-b);
return 0;
}

06-16 165 08-27 47
08-27 42
12-01 88
12-04 764
07-14 8955
04-23 2508
01-29 74
01-24 37