1.求出男生中成绩最低的，女生中成绩最高的，并且输出两者的差。没有的话输出Absent和NA。
2.简单的重写比较函数。
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
//#include<string>
//#include <iomanip>
#include<vector>
#include <algorithm>
//#include<stack>
#include<set>
#include<queue>
#include<map>
//#include<unordered_set>
#include<unordered_map>
//#include <sstream>
//#include "func.h"
//#include <list>
#include<stdio.h>
#include<iostream>
#include<string>
#include<memory.h>
#include<limits.h>
using namespace std;
struct studentNode{
string name;
string id;
int grade;
studentNode(string n, string i, int g) :name(n), id(i), grade(g){};
studentNode() :name(""), id(""), grade(0){};
};
bool cmpM(const studentNode&a, const studentNode&b)
{
return a.grade < b.grade;
}
bool cmpF(const studentNode&a, const studentNode&b)
{
return a.grade > b.grade;
}
int main(void)
{
int n;
cin >> n;
vector<studentNode> m(0);
vector<studentNode> f(0);
for (int i = 0; i < n; i++)
{
string name, id, gender;
int grade;
cin >> name >> gender >> id >> grade;
if (gender == "F")
f.push_back(studentNode(name, id, grade));
else
m.push_back(studentNode(name, id, grade));
}
sort(f.begin(), f.end(), cmpF);
sort(m.begin(), m.end(), cmpM);
if (f.size()>0)
cout << f[0].name << " " << f[0].id << endl;
else
cout << "Absent" << endl;
if (m.size()>0)
cout << m[0].name << " " << m[0].id << endl;
else
cout << "Absent" << endl;
if (f.size() > 0 && m.size() > 0)
cout << f[0].grade - m[0].grade << endl;
else
cout << "NA" << endl;
return 0;
}
