Author: CHEN, Yue
Organization: 浙江大学
Time Limit: 400 ms
Memory Limit: 64 MB
Code Size Limit: 16 KB
A1083. List Grades (25)
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
Code
//NKW 甲级练习题1003
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn = 10010;
const int maxk = 5;
struct person{
char name[20], id[20];
int grade;
}people;
vector<person> vi;
bool cmp(person a, person b){
return a.grade > b.grade;
}
int main(){
int n, grade1, grade2;
bool flag = false;
scanf("%d", &n);
for (int i = 0; i < n; i++){
scanf("%s %s %d", people.name, people.id, &people.grade);
vi.push_back(people);
}
sort(vi.begin(), vi.end(), cmp); //vector的sort函数
scanf("%d %d", &grade1, &grade2);
for (int i = 0; i < n; i++){
if (vi[i].grade >= grade1&&vi[i].grade <= grade2){
printf("%s %s\n", vi[i].name, vi[i].id);
flag = true;
}
}
if (!flag)
printf("NONE\n");
return 0;
}
Analysis
-给出N位考生的姓名、准考证号、分数,将这些信息从高到低排序,并输出分数在给定区间[left, right] 之间的考生信息。如果不存在满足条件的考生,输出“NONE”.