1083. List Grades (25) PAT
阿新 • • 發佈:2018-11-20
簡單題
#include<cstdio> #include<cstring> #include<iostream> #include<vector> #include<algorithm> #include<map> using namespace std; struct node{ string name; string id; int grade; }stu[100000]; int N,a,b; int com(struct node a,struct node b){ return a.grade>b.grade; } int main(){ scanf("%d",&N); getchar(); for(int i=0;i<N;i++){ cin>>stu[i].name>>stu[i].id>>stu[i].grade; } scanf("%d%d",&a,&b); sort(stu,stu+N,com); int tmp=0; for(int i=0;i<N;i++){ if(stu[i].grade>=a&&(stu[i].grade<=b)){ cout<<stu[i].name<<' '<<stu[i].id<<endl; tmp=1; } } if(!tmp){ cout<<"NONE"<<endl; } return 0; }