zoukankan      html  css  js  c++  java
  • PTA(Advanced Level)1036.Boys vs Girls

    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**Fgrade**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
    
    思路
    • 跟之前的PTA(Basic Level)1028.人口普查仍旧有点像,不过这里要分男女情况来比较。不过比较的内容是分数,和之前相比算简单的了
    代码
    #include<bits/stdc++.h>
    using namespace std;
    struct student
    {
    	char name[20];
    	char gender;
    	char id[20];
    	int grade;
    }female_high, male_low;
    
    void Init()
    {
    	female_high.grade = -1;
    	male_low.grade = 110;
    }
    
    bool higher(student a, student b)
    {
    	return a.grade > b.grade;
    }
    
    int main()
    {
    	int n;
    	Init();
    	scanf("%d", &n);
    	student tmp;
    	while(n--)
    	{
    		scanf("%s %c %s %d", tmp.name, &tmp.gender, tmp.id, &tmp.grade);
    		if(tmp.gender == 'M' && higher(male_low, tmp))
    			male_low = tmp;
    		if(tmp.gender == 'F' && higher(tmp, female_high))
    			female_high = tmp;
    	}
    
    	bool absent = false;
    	if(female_high.grade == -1)
    	{
    		printf("Absent
    ");
    		absent = true;
    	}else printf("%s %s
    ", female_high.name, female_high.id);
    	if(male_low.grade == 110)
    	{
    		printf("Absent
    ");
    		absent = true;
    	}else printf("%s %s
    ", male_low.name, male_low.id);
    	if(absent)
    		printf("NA");
    	else printf("%d", female_high.grade - male_low.grade);
    	return 0;
    }
    
    
    引用

    https://pintia.cn/problem-sets/994805342720868352/problems/994805453203030016

  • 相关阅读:
    Codeforces Round #551 (Div. 2) F. Serval and Bonus Problem (DP/FFT)
    Codeforces Round #551 (Div. 2) E. Serval and Snake (交互题)
    BZOJ 5495: [2019省队联测]异或粽子 (trie树)
    洛谷【P2669】NOIP2015普及组 T1金币
    解决Win 10上SSD缓慢问题
    如何保障数据安全
    一个网工的linux学习过程
    JS实现select去除option的使用注意事项
    codevs1506传话(kosaraju算法)
    我的园子
  • 原文地址:https://www.cnblogs.com/MartinLwx/p/11665090.html
Copyright © 2011-2022 走看看