zoukankan      html  css  js  c++  java
  • 入门模拟——A1036.Boys vs Girls

    #include <bits/stdc++.h>
    #include<math.h>
    using namespace std;
    struct Student{
        char name[10];
        char gender;
        char number[10];
        int grade;
    }man,woman;
    const int MAX_LEN = 100005;
    int main(){
        woman.gender = 'F';
        woman.grade = -1;
        man.gender = 'M';
        man.grade = 101;
        int n;
        cin>>n;
        for(int i = 0;i<n;++i){
            Student temp;
            scanf("%s %s %s %d",&temp.name,&temp.gender,&temp.number,&temp.grade);
            if(temp.gender == 'F' && temp.grade > woman.grade){
                memset(woman.name,'',sizeof(woman.name));
                strcpy(woman.name,temp.name);
                memset(woman.number,'',sizeof(woman.number));
                strcpy(woman.number,temp.number);
                woman.grade = temp.grade;
            }
            if(temp.gender == 'M' && temp.grade < man.grade){
                memset(man.name,'',sizeof(man.name));
                strcpy(man.name,temp.name);
                memset(man.number,'',sizeof(man.number));
                strcpy(man.number,temp.number);
                man.grade = temp.grade;
                
            }
        }
        int count = abs(man.grade - woman.grade);
        if(woman.grade == -1){
            printf("Absent
    ");
        }else{
            cout<<woman.name<<" "<<woman.number<<endl;
        }
        if(man.grade == 101){
            printf("Absent
    ");
        }else{
            cout<<man.name<<" "<<man.number<<endl;
        }
        if(woman.grade == -1 || man.grade == 101){
            printf("NA");
        }else{
            printf("%d",count);
        }
        system("pause");
        return 0;
    } 
  • 相关阅读:
    第一周博客作业(学习历程和感想)
    WordCount 基础功能
    MyBatis 分页插件 PageHelper 使用
    手机尾号猜年龄骗局解密
    逻辑思维题一
    给div添加滚动条
    my97中文乱码问题
    cookie中文乱码
    多线程下的单例模式
    HTML5的入门与深入理解
  • 原文地址:https://www.cnblogs.com/JasonPeng1/p/12118030.html
Copyright © 2011-2022 走看看