标签:
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
思路:本题无思路。
1 #include <iostream> 2 #include <cstdio> 3 #include <algorithm> 4 using namespace std; 5 #define MAX 100010 6 struct Record 7 { 8 char name[12]; 9 char ID[12]; 10 int grade; 11 }Record[MAX]; 12 bool cmp(struct Record A,struct Record B) 13 { 14 return A.grade>B.grade; 15 } 16 int main(int argc, char *argv[]) 17 { 18 int N; 19 scanf("%d",&N); 20 for(int i=0;i<N;i++) 21 { 22 scanf("%s %s %d",Record[i].name,Record[i].ID,&Record[i].grade); 23 } 24 sort(Record,Record+N,cmp); 25 int grade1,grade2; 26 scanf("%d%d",&grade1,&grade2); 27 bool flag=false; 28 for(int i=0;i<N;i++) 29 { 30 if(Record[i].grade>=grade1&&Record[i].grade<=grade2) 31 { 32 flag=true; 33 printf("%s %s\n",Record[i].name,Record[i].ID); 34 } 35 } 36 if(!flag) 37 printf("NONE\n"); 38 return 0; 39 }
标签:
原文地址:http://www.cnblogs.com/GoFly/p/4290816.html