【PAT (Advanced Level)】1036. Boys vs Girls (25)

1036. Boys vs Girls (25)

时间限制

400 ms

内存限制

32000 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 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:

3Joe M Math990112 89Mike M CS991301 100Mary F EE990830 95

Sample Output 1:

Mary EE990830Joe Math9901126

Sample Input 2:

1Jean M AA980920 60

Sample Output 2:

AbsentJean AA980920NA

这个题和之前那个List Grade的题目很像，就是多了性别区分，可以放在两个vector里，分别排序，一个取最大，一个取最小，然后输出就可以了；

代码如下：

/************************************This is a test program for anythingEnjoy IT!************************************/#include <iostream>#include <iomanip>#include <algorithm>#include <vector>#include <list>#include <set>#include <fstream>#include <string>#include <cmath>using namespace std;struct Student{string name;string ID;int grade;char sex;Student(string name, char sex, string ID, int grade): name(name), sex(sex), ID(ID), grade(grade){}};bool UPcomp(const Student &l, const Student &r){return l.grade > r.grade;}int main(){ifstream cin;cin.open("in.txt");ofstream cout;cout.open("out.txt");//////////////////////////////////////////////////////////////////////////// TO DO Whatever You WANT!int n;while (cin >> n){vector<Student> mList;vector<Student> fList;bool flag[2] = { false };for (int i = 0; i < n; i++) // 输入所有信息{string name, id;char sex;int grade;cin >> name >> sex >> id >> grade;Student st(name, sex, id, grade);if (sex == 'M') // 按性别分类{mList.push_back(st);flag[1] = true;}else{fList.push_back(st);flag[0] = true;}}// 排序if (flag[0]) sort(fList.begin(), fList.end(), UPcomp);if (flag[1]) sort(mList.begin(), mList.end(), UPcomp);// 输出if (flag[0]){cout << fList.front().name << " " << fList.front().ID << endl;}else{cout << "Absent" << endl;}if (flag[1]){cout << mList.back().name << " " << mList.back().ID << endl;}else{cout << "Absent" << endl;}if (flag[0] && flag[1]){cout << fList.front().grade - mList.back().grade << endl;}else{cout << "NA" << endl;}}//////////////////////////////////////////////////////////////////////////// system("pause");return 0;}