用java成绩排序_成绩排序 - java程序员填空 - 博客园

2 87

1 90

3 92

干了一天的运维，有点累了，上九度刷了一道题，记录一下吧，直接上AC代码，题目本身没难度，一看就知道结构体数组

#include

#include

struct student

{

int number;

int score;

};

int main()

{

struct student students[101];

int n, i, j;

struct student temp;

while(scanf("%d",&n) != EOF)

{

//接收数据

for(i = 0; i < n; i++)

{

scanf("%d%d",&students[i].number,&students[i].score);

}

//冒泡排序

for(i = 0; i < n - 1; i ++)

{

for(j = 0; j < n - i - 1; j ++)

{

if(students[j].score > students[j + 1].score)

{

temp = students[j];

students[j] = students[j + 1];

students[j + 1] = temp;

}else if(students[j].score == students[j + 1].score)

{

if(students[j].number > students[j + 1].number)

{

temp = students[j];

students[j] = students[j + 1];

students[j + 1] = temp;

}

}

}

}

//输出排序结果

for(i = 0; i < n; i ++)

{

printf("%d %d\n",students[i].number,students[i].score);

}

}

return 0;

}