PAT 1083

#include<cstdio>#include<algorithm>#include<stdlib.h>#include<cstring>using namespace std;const int maxn=100010;struct student{	char name[11];	char id[11];//10个字母至少11格存储，10会报错	int grade; }st[maxn];bool cmp(student x,student y){	if(x.grade!=y.grade)		return x.grade>y.grade;}int main(){	int n;	scanf("%d",&n);	for(int i=0;i<n;i++)	{		scanf("%s %s %d",st[i].name,st[i].id,&st[i].grade);	}	sort(st,st+n,cmp);	int grade1,grade2;	scanf("%d%d",&grade1,&grade2);	int PRintnum=0;	for(int i=0;i<n;i++)	{		if(st[i].grade>=grade1&&st[i].grade<=grade2)		{			printf("%s %s/n",st[i].name,st[i].id);			printnum++;		}	}	if(printnum==0)		printf("NONE");	system("pause");	return 0;}