pat 1083. List Grades WATER

实在没什么好说的，上码

#include<stdio.h>#include<algorithm>struct node{int grade;char name[12];char id[12];};node arr[105];int com(const node &a,const node &b){return a.grade>b.grade;}int main(){int n,i,g1,g2;scanf("%d",&n);for(i=0;i<n;i++){scanf("%s %s %d",&arr[i].name,&arr[i].id,&arr[i].grade);}scanf("%d %d",&g1,&g2);std::sort(arr,arr+n,com);int j1=-1,j2=-2,k=0;for(i=0;i<n;i++){if(!k&&arr[i].grade<=g2){j1=i;j2=n;k++;}if(arr[i].grade<g1){j2=i;break;}}j2--;if(j2<j1)printf("NONE\n");else{for(i=j1;i<=j2;i++)printf("%s %s\n",arr[i].name,arr[i].id);}return 0;}