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:
|
1 2 3 4 5 6 |
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:
|
1 2 3 4 5 6 |
4 Tom CS000001 59 Joe Math990112 89 Mike CS991301 100 Mary EE990830 95 60 100 |
Sample Output 1:
|
1 2 3 |
Mike CS991301 Mary EE990830 Joe Math990112 |
Sample Input 2:
|
1 2 3 4 |
2 Jean AA980920 60 Ann CS01 80 90 95 |
Sample Output 2:
|
1 |
NONE |
排序即可……
代码如下：
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 |
#include<stdio.h> #include<stdlib.h> typedef struct info_ { char name[11]; char id[11]; int grade; } info; int compare(const void *a,const void *b) { return ((info *)b)->grade-((info *)a)->grade; } int main() { int n,i,min,max,flag=1; info *student; scanf("%d",&n); student=(info *)malloc(n*sizeof(info)); for(i=0;i<n;i++) { scanf("%s%s%d",student[i].name,student[i].id,&(student[i].grade)); } scanf("%d%d",&min,&max); qsort(student,n,sizeof(info),compare); for(i=0;i<n;i++) { if(student[i].grade>=min&&student[i].grade<=max) { printf("%s %s\n",student[i].name,student[i].id); flag=0; } } if(flag) { printf("NONE\n"); } } |