PAT甲级1036

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

struct Node{
	string name, id;
	int mark;
	int grade;
};

bool cmp1(Node a, Node b){
	return a.grade < b.grade;
}
bool cmp2(Node a, Node b){
	return a.grade > b.grade;
}

int main(){
	int n, dif;
	string name, id;
	char gender;
	int grade;
	Node stu;
	vector<Node> male;
	vector<Node> female;
	cin >> n;
	for (int i = 0; i < n; i++){
		cin >> name >> gender >> id >> grade;
		stu.name = name;
		stu.id = id;
		stu.grade = grade;
		stu.mark = gender == 'F' ? 1 : 0;
		if (stu.mark == 1) female.push_back(stu);
		else male.push_back(stu);
	}
	if (female.size() != 0 && male.size() != 0){
		sort(female.begin(), female.end(), cmp2);
		sort(male.begin(), male.end(), cmp1);
		dif = abs(female[0].grade - male[0].grade);
		cout << female[0].name << " " << female[0].id << endl << male[0].name << " " << male[0].id << endl << dif;
	}
	if (female.size() == 0 && male.size() == 0){
		cout << "Absent" << endl << "Absent" << endl << "NA";
	}
	if (female.size() == 0 && male.size() != 0){
		sort(male.begin(), male.end(), cmp1);
		cout << "Absent" << endl << male[0].name << " " << male[0].id << endl << "NA";
	}
	if (female.size() != 0 && male.size() == 0){
		sort(female.begin(), female.end(), cmp2);
		cout << female[0].name << " " << female[0].id << endl << "Absent" << endl << "NA";
	}
}