#include
struct Student{
char name[11];
char num[11];
int grade;
};
void swap(int m,int n){
int t;
t=m;
m=n;
n=t;
}
int main(){
int n,i,j,max,min;
struct Student students[10000];
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%s %s %d\n",students[i].name,students[i].num,&students[i].grade);
for(i=0;i<n-1;i++){
max=students[i].grade;
for(j=i+1;j<n;j++){
if(students[i].grade<students[j].grade)
swap(students[i].grade,students[j].grade);
else
continue;
}
}
printf("%s %s\n",students[0].name,students[0].num);
printf("%s %s",students[n-1].name,students[n-1].num);
return 0;
}
整个程序运行下来3个测试例只能通过一个,能帮忙看一下哪儿出问题了,哪些地方需要改进?