Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 趣味 » 

PAT 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 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

Joe M Math990112 89
Mike M CS991301 100
Mary F EE990830 95

Sample Output 1

Mary EE990830
Joe Math990112
Sample Input 2:

Jean M AA980920 60

Sample Output 2

Jean AA980920


#include <cstdio>
#include <algorithm>
using namespace std;

const int mxsz = 1000000;
struct Stu { char name[11], sex, id[11]; int gra; } stu[mxsz];
int n, n1 = 0, n2 = 0, a1[mxsz], a2[mxsz];

bool cmp(const int &a, const int &b) { return stu[a].gra < stu[b].gra; }

int main()
	scanf("%d", &n); 
	for (int i = 0; i < n; i++)
		scanf("%s %c %s %d", &stu[i].name, &stu[i].sex, &stu[i].id, &stu[i].gra);
		if (stu[i].sex == 'F') a1[n1++] = i;
		else a2[n2++] = i;

	if (!n1)
		sort(a1, a1+n1, cmp);
		printf("%s %s\n", stu[a1[n1-1]].name, stu[a1[n1-1]].id);

	if (!n2)
		sort(a2, a2+n2, cmp);
		printf("%s %s\n", stu[a2[0]].name, stu[a2[0]].id);

	if (n1 && n2) printf("%d\n", stu[a1[n1-1]].gra - stu[a2[0]].gra);
	else printf("NA\n");

	return 0;
上一篇: 下一篇: