PAT a1083题解

#include <cstdio>#include <algorithm>using namespace std;struct Student{char name[15];char id[15];int grade;}stu[10000];bool cmp(Student a, Student b){return a.grade > b.grade;}int main(){bool hasInInterval = false;int n;scanf("%d", &n);for(int i = 0; i < n; i++){scanf("%s %s %d", stu[i].name, stu[i].id, &stu[i].grade);}int min, max;scanf("%d%d", &min, &max);sort(stu, stu + n, cmp);for(int i = 0; i < n; i++){if(stu[i].grade >= min && stu[i].grade <= max){hasInInterval = true;printf("%s %s\n", stu[i].name, stu[i].id);}}if(!hasInInterval){printf("NONE");}return 0;}