PTA甲级 1036 Boys vs Girls (C++)

最新推荐文章于 2022-08-13 23:48:47 发布

负反馈循环

最新推荐文章于 2022-08-13 23:48:47 发布

阅读量116

点赞数

分类专栏： PTA 文章标签：学生信息成绩处理性别比较最高分最低分

本文链接：https://blog.csdn.net/qq_43659183/article/details/119731060

版权

PTA 专栏收录该内容

148 篇文章 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 $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

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-16 13:05:18
// All rights reserved.

#include <iostream>
#include <vector>

using namespace std;

struct Student{
    string name;
    string ID;
    char gender;
    int grade;

    Student(string n, string id, char ge, int g){
        name = n;
        ID = id;
        gender = ge;
        grade = g;
    }

    ~Student(){}
};

int main(){
    int n;
    scanf("%d", &n);
    string name, ID;
    char gender;
    int grade;

    int maleMinPos = -1, femaleMaxPos = -1;
    vector<Student> students;

    for(int i = 0; i < n; ++i){
        cin >> name >> gender >> ID >> grade;

        students.emplace_back(name, ID, gender, grade);

        if(gender == 'M'){
            if(maleMinPos == -1) maleMinPos = i;
            else if(grade < students[maleMinPos].grade) maleMinPos = i;
        } 
        else{
            if(femaleMaxPos == -1) femaleMaxPos = i;
            else if(grade > students[femaleMaxPos].grade) femaleMaxPos = i;
        }
    }

    if(femaleMaxPos == -1){
        printf("Absent\n");
        printf("%s %s\n", students[maleMinPos].name.c_str(), students[maleMinPos].ID.c_str());
        printf("NA\n");
        
        return 0;
    }

    else if(maleMinPos == -1){
        printf("%s %s\n", students[femaleMaxPos].name.c_str(), students[femaleMaxPos].ID.c_str());
        printf("Absent\n");
        printf("NA\n");
        
        return 0;
    }

    printf("%s %s\n", students[femaleMaxPos].name.c_str(), students[femaleMaxPos].ID.c_str());
    printf("%s %s\n", students[maleMinPos].name.c_str(), students[maleMinPos].ID.c_str());
    printf("%d\n", students[femaleMaxPos].grade - students[maleMinPos].grade);

    return 0;
}