#include<stdio.h>
int main(){
struct student{
int num;
int sch;
};
struct student temp;
student s[32]={{392,81},{343,94},{948,90},{237,84},{240,85},{202,73},{298,91},{459,37},{304,80},{403,85},{314,66},{322,30},{460,80},{465,48},{361,40},{377,92},{442,85},{446,92},{983,62},{469,74},{472,32},{479,85},{493,77},{497,76},{517,90},{506,78},{534,67},{539,92},{522,74},{826,75},{530,31},{482,76}};
int i,j,index;
for(i=0;i<32-1;i++){
index=i;
for(j=i+1;j<32;j++)
if(s[j].sch>s[index].sch)
index = j;
temp=s[index];
s[index]=s[i];
s[i]=temp;
}
for(i=0;i<32;i++)
{
printf("全班第%d名%d %d\n",i,s[i].num,s[i].sch);
}
return 0;
}
结构体排序实例
猜你喜欢
转载自blog.csdn.net/yizhixiaoma/article/details/80396573
今日推荐
周排行