• PAT 1036 Boys vs Girls[简单]


    1036 Boys vs Girls (25 分)

    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 namegenderID and grade, separated by a space, where nameand 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

     题目大意:给出m个女孩和男孩的名字课程分数信息,求女孩中分数最高与男孩中分数最低的。

    //这道题真的老简单了。。。一次过。。都不想写博客来着。。

    #include <iostream>
    #include <algorithm>
    #include <vector>
    #include<cstdio>
    using namespace std;
    
    int main()
    {
        int n;
        cin>>n;
        string name,s,task;
        int sco;
        string fn,mn;//最终的名字
        string ft,mt;//最终的科目
        int fs=-1,ms=101;//最终的得分。
        for(int i=0;i<n;i++){
            cin>>name>>s>>task>>sco;
            if(s=="F"&&sco>fs){
                fn=name;
                ft=task;
                fs=sco;
            }else if(s=="M"&&sco<ms){
                mn=name;
                mt=task;
                ms=sco;
            }
        }
        if(fs==-1){//如果没有女性
            cout<<"Absent
    ";
        }else {
            cout<<fn<<" "<<ft<<"
    ";
        }
        if(ms==101){
            cout<<"Absent
    ";
        }else{
            cout<<mn<<" "<<mt<<"
    ";
        }
        if(fs==-1||ms==101){
            cout<<"NA";
        }else{
            cout<<fs-ms;
        }
    
        return 0;
    }
  • 相关阅读:
    SDOI2017 R2泛做
    类似静态区间逆序对的题的一些做法
    友链&&日记
    注意事项以及一些奇怪的姿势
    关于各种算法以及好的blog的整理(持续更新)
    PKUSC2019游记
    洛谷P5398 [Ynoi2018]GOSICK(二次离线莫队)
    洛谷P4887 第十四分块(前体)(二次离线莫队)
    [51nod]1678 lyk与gcd(莫比乌斯反演)
    LOJ#557. 「Antileaf's Round」你这衣服租来的吗(FHQ Treap+珂朵莉树)
  • 原文地址:https://www.cnblogs.com/BlueBlueSea/p/9912284.html
Copyright © 2020-2023  润新知