A1083. 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:

Nname[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 aredistinct.

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:

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

Sample Output 1:

Mike CS991301Mary EE990830Joe Math990112

Sample Input 2:

2Jean AA980920 60Ann CS01 8090 95

Sample Output 2:

NONE

这题50%通过率不是盖得···

他自己说id不超过10个，样例超过了，傻逼

#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>using namespace std;struct Student{char name[10],id[15];int grade;}stu[100010];bool cmp(Student a,Student b){if(a.grade!=b.grade) return a.grade>b.grade;else return strcmp(a.id,b.id)<0;}int main(){int grade1,grade2,n,i,j;j=0;scanf("%d",&n);for(i=0;i<n;i++){scanf("%s %s %d",stu[i].name,stu[i].id,&stu[i].grade);}scanf("%d %d",&grade1,&grade2);sort(stu,stu+n,cmp);for(i=0;i<n;i++){if(stu[i].grade>=grade1&&stu[i].grade<=grade2){printf("%s %s\n",stu[i].name,stu[i].id);j=1;}}if(j==0)printf("NONE\n");return 0;}