PAT 1036. Boys vs Girls (25)（简单成绩排序）

官网

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

题目大意

• 1.找出女生成绩最高的和男生成绩最低的，都存在则做减法，没有则按要求输出。

AC代码

#include<queue>#include<string>#include<iostream>#include<algorithm>using namespace std;struct student {    string name,gender,id;    int grade;    student(string _n,string _g ,string _id,int _grade):name(_n),gender(_g),id(_id),grade(_grade){}};bool cmp(const student & a,const student & b){    return a.grade > b.grade;}int main(int argc, char *argv[]){    int n;    //priority_queue<student> stu;    cin >> n;    vector<student> man,woman;    string name,gender,id; int grade;    //输入    for (int i = 0; i < n; ++i) {        cin >> name >> gender >> id >> grade;        if (gender == "M") {            man.push_back(student(name,gender,id,grade));        }else if (gender == "F") {            woman.push_back(student(name,gender,id,grade));        }    }    //排序和输出    if (man.empty()||woman.empty()) {        if (woman.empty()) {            cout << "Absent" << endl;        }else {            sort(woman.begin(),woman.end(),cmp);            cout << woman[0].name << " " <<woman[0].id << endl;        }        if (man.empty()) {            cout << "Absent" << endl;        }else {            sort(man.begin(),man.end(),cmp);            cout << man[man.size()-1].name << " " <<man[man.size()-1].id << endl;        }        cout << "NA" << endl;    }else {        sort(woman.begin(),woman.end(),cmp);        cout << woman[0].name << " " <<woman[0].id << endl;        sort(man.begin(),man.end(),cmp);        cout << man[man.size()-1].name << " " <<man[man.size()-1].id << endl;        cout << woman[0].grade - man[man.size()-1].grade << endl;    }    return 0;}