aha-algorithm/chapter1/d3.c

40 lines
669 B
C
Raw Normal View History

2023-07-25 20:25:58 +08:00
#include <stdio.h>
struct student
{
char name[21]; // 21 个字节
int score;
};
int main()
{
struct student a[100], t;
int i, j, n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
scanf("%s %d", a[i].name, &a[i].score);
}
for (i = 1; i <= n - 1; i++)
{
for (j = 1; j <= n - i; j++)
{
if (a[j].score < a[j + 1].score)
{
t = a[j];
a[j] = a[j + 1];
a[j + 1] = t;
}
}
}
printf("\033[2J");
for (int i = 1; i <= n; i++)
printf("%s\n", a[i].name);
getchar();
getchar();
return 0;
}