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

PAT 1083. List Grades

Given a list of N student records with name, ID and grade. You are supposed to sort the records with respect to the grade in non-increasing order, and output those student records of which the grades are in a given interval.

Input Specification

Each input file contains one test case. Each case is given in the following format:

N
name[1] ID[1] grade[1]
name[2] ID[2] grade[2]
… …
name[N] ID[N] grade[N]
grade1 grade2
where name[i] and ID[i] are strings of no more than 10 characters with no space, grade[i] is an integer in [0, 100], grade1 and grade2 are the boundaries of the grade’s interval. It is guaranteed that all the grades are distinct.

Output Specification

For each test case you should output the student records of which the grades are in the given interval [grade1, grade2] and are in non-increasing order. Each student record occupies a line with the student’s name and ID, separated by one space. If there is no student’s grade in that interval, output "NONE" instead.

Sample Input 1

4
Tom CS000001 59
Joe Math990112 89
Mike CS991301 100
Mary EE990830 95
60 100

Sample Output 1

Mike CS991301
Mary EE990830
Joe Math990112

Sample Input 2

2
Jean AA980920 60
Ann CS01 80
90 95

Sample Output 2

NONE

解答

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

const int mxsz = 100000 + 10;  
struct Stu { char name[20], id[20], gra; } stu[mxsz];
int n, a[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%s%d", &stu[i].name, &stu[i].id, &stu[i].gra), a[i] = i;
	sort(a, a+n, cmp);
	int st, ed, exist = 0; scanf("%d%d", &st, &ed);
	for (int i = 0; i < n; i++)
		if (stu[a[i]].gra >= st && stu[a[i]].gra <= ed)
			exist = 1, printf("%s %s\n", stu[a[i]].name, stu[a[i]].id);
	if (!exist) printf("NONE\n");
	return 0;
}
上一篇: 下一篇:

我的博客

NoAlGo头像编程这件小事牵扯到太多的知识,很容易知其然而不知其所以然,但真正了不起的程序员对自己程序的每一个字节都了如指掌,要立足基础理论,努力提升自我的专业修养。

站内搜索

最新评论