1083. List Grades (25)

1083. List Grades (25)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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<iostream>
#include<stdio.h>

using namespace std;

#define MAX 1000

typedef struct{
	char name[11];
	char ID[11];
	int grade;
}Student;

/**冒泡递减排序**/
void bubbleSort(Student sList[], int len){
	for(int i = len; i > 0; i--){
		int flag = 0; //用于标记一趟排序是否发生交换 0 没有发生交换 1 发生交换
		for(int j = 1; j < i; j++){
			if(sList[j].grade > sList[j-1].grade){
				Student temp;
				temp = sList[j];
				sList[j] = sList[j-1];
				sList[j-1] = temp;
				flag = 1;
			}
		}
		if(flag == 0){
			return;
		}
	}
}

int main(){
	int num, grade1, grade2;
	int outSum = 0; //用于记录是否有符合条件的记录
	Student studentList[MAX];
	scanf("%d", &num);
	for(int i = 0; i < num; i++){
		scanf("%s %s %d", &studentList[i].name, &studentList[i].ID, &studentList[i].grade);
	}
	bubbleSort(studentList, num); //按成绩递减排序
	scanf("%d %d", &grade1, &grade2);
	for(int i = 0; i < num; i++){
		if(studentList[i].grade <= grade2 && studentList[i].grade >= grade1){
			outSum++;
			printf("%s %s\n", studentList[i].name, studentList[i].ID);
		}
	}
	if(outSum == 0){
		printf("NONE");
	}
	return 0;
}