首页 最新 热门 推荐

  • 首页
  • 最新
  • 热门
  • 推荐

PAT甲级-1036 Boys vs Girls (25分)

  • 24-03-03 00:43
  • 3771
  • 9549
blog.csdn.net

点击链接PAT甲级-AC全解汇总

题目:
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
  • 1
  • 2
  • 3
  • 4

Sample Output 1:

Mary EE990830
Joe Math990112
6
  • 1
  • 2
  • 3

Sample Input 2:

1
Jean M AA980920 60
  • 1
  • 2

Sample Output 2:

Absent
Jean AA980920
NA
  • 1
  • 2
  • 3

题意:
输入学生的成绩,分男生女生,求女生最高分和男生最低分的差值,如果没有男生或女生则输出absent和na

我的代码:

#include
using namespace std;

int main(){
    string m_name,m_id,f_name,f_id;
    int m_s=111,f_s=-1;
    int N;
    cin>>N;
    for(int i=0;i<N;i++)
    {
        string name,m_f,id;
        int score;
        cin>>name>>m_f>>id>>score;

        if(m_f=="M"&&score<m_s)
        {
            m_name=name;
            m_id=id;
            m_s=score;
        }
        else if(m_f=="F"&&score>f_s)
        {
            f_name=name;
            f_id=id;
            f_s=score;
        }
    }
    if(f_s!=-1)cout<<f_name<<" "<<f_id<<endl;
    else cout<<"Absent"<<endl;
    if(m_s!=111)cout<<m_name<<" "<<m_id<<endl;
    else cout<<"Absent"<<endl;
    if(m_s==111||f_s==-1)cout<<"NA"<<endl;
    else cout<<f_s-m_s<<endl;
    return 0;
}

  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
  • 11
  • 12
  • 13
  • 14
  • 15
  • 16
  • 17
  • 18
  • 19
  • 20
  • 21
  • 22
  • 23
  • 24
  • 25
  • 26
  • 27
  • 28
  • 29
  • 30
  • 31
  • 32
  • 33
  • 34
  • 35
  • 36
注:本文转载自blog.csdn.net的邂逅模拟卷的文章"https://blog.csdn.net/qq_34451909/article/details/105432756"。版权归原作者所有,此博客不拥有其著作权,亦不承担相应法律责任。如有侵权,请联系我们删除。
复制链接
复制链接
相关推荐
发表评论
登录后才能发表评论和回复 注册

/ 登录

评论记录:

未查询到任何数据!
回复评论:

分类栏目

后端 (14832) 前端 (14280) 移动开发 (3760) 编程语言 (3851) Java (3904) Python (3298) 人工智能 (10119) AIGC (2810) 大数据 (3499) 数据库 (3945) 数据结构与算法 (3757) 音视频 (2669) 云原生 (3145) 云平台 (2965) 前沿技术 (2993) 开源 (2160) 小程序 (2860) 运维 (2533) 服务器 (2698) 操作系统 (2325) 硬件开发 (2492) 嵌入式 (2955) 微软技术 (2769) 软件工程 (2056) 测试 (2865) 网络空间安全 (2948) 网络与通信 (2797) 用户体验设计 (2592) 学习和成长 (2593) 搜索 (2744) 开发工具 (7108) 游戏 (2829) HarmonyOS (2935) 区块链 (2782) 数学 (3112) 3C硬件 (2759) 资讯 (2909) Android (4709) iOS (1850) 代码人生 (3043) 阅读 (2841)

热门文章

101
推荐
关于我们 隐私政策 免责声明 联系我们
Copyright © 2020-2025 蚁人论坛 (iYenn.com) All Rights Reserved.
Scroll to Top