c语言代码解决问题快速排序

解题思路:

注意事项:

参考代码:

#include<stdio.h>

#include<stdlib.h>

typedef struct student

{

int id;

int chinese;

int math;

int english;

int sumscore;

}Student;

int compare(const void* a, const void* b)

{

Student *A = (Student *)a;

Student *B = (Student*)b;

if (A->sumscore != B->sumscore)

return B->sumscore - A->sumscore;

else

{

if (A->chinese != B->chinese)

return B->chinese - A->chinese;

else

{

return A->id - B->id;

}

}

}

int main()

{

int n,i;

scanf("%d", &n);

Student* a = (Student*)malloc(sizeof(Student) * n);

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

{

scanf("%d %d %d", &a[i].chinese, &a[i].math, &a[i].english);

a[i].sumscore = a[i].chinese + a[i].math + a[i].english;

a[i].id = i + 1;

}

qsort(a, n, sizeof(Student), compare);

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

{

printf("%d %d", a[i].id, a[i].sumscore);

if (i != 4)

printf("\n");

}

return 0;

}