首页 > 其他 > 详细

zju pat 1036

时间:2014-01-29 15:23:15      阅读:462      评论:0      收藏:0      [点我收藏+]
bubuko.com,布布扣
//1036
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
using namespace std;
typedef struct DATA
{
    char name[20];
    char gender;
    char ID[20];
    int grade;
};
DATA data;
DATA femal_highest;
DATA male_lowest;

int main()
{
    int N,i,j,no_count;
    bool easy_flag;
    while(scanf("%d",&N)!=EOF)
    {
        femal_highest.grade = -1;
        male_lowest.grade = 101;
        for(i =0;i<N;i++)
        {
            scanf("%s %c %s %d",data.name,&data.gender,data.ID,&data.grade);
            if(data.gender == F)
            {
                if(data.grade > femal_highest.grade)
                {
                    strcpy(femal_highest.name,data.name);
                    strcpy(femal_highest.ID,data.ID);
                    femal_highest.grade = data.grade;
                }
            }
            else
            {
                if(data.grade < male_lowest.grade)
                {
                    strcpy(male_lowest.name,data.name);
                    strcpy(male_lowest.ID,data.ID);
                    male_lowest.grade = data.grade;
                }
            }
        }
        if(femal_highest.grade !=-1)
        {
            printf("%s %s\n",femal_highest.name,femal_highest.ID);
        }
        else
        {
            printf("Absent\n");
        }
        if(male_lowest.grade != 101)
        {
            printf("%s %s\n",male_lowest.name,male_lowest.ID);
        }
        else
        {
            printf("Absent\n");
        }
        if(femal_highest.grade!=-1 && male_lowest.grade !=101)
            printf("%d\n",femal_highest.grade - male_lowest.grade);
        else
            printf("NA\n");
    }
    return 0;
}
bubuko.com,布布扣

zju pat 1036

原文:http://www.cnblogs.com/cheng07045406/p/3536125.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!