|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
#include <stdlib.h> // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> qsort <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͷ<EFBFBD>ļ<EFBFBD>
|
|
|
|
|
|
|
|
|
|
|
|
// ѧ<><D1A7><EFBFBD><EFBFBD>Ϣ<EFBFBD>Ľṹ<C4BD><E1B9B9>
|
|
|
|
|
|
struct Student {
|
|
|
|
|
|
int student_id;
|
|
|
|
|
|
int class_id;
|
|
|
|
|
|
float score1;
|
|
|
|
|
|
float score2;
|
|
|
|
|
|
float score3;
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
// <20>ȽϺ<C8BD><CFBA><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
int compareStudents(const void *a, const void *b) {
|
|
|
|
|
|
struct Student *student1 = (struct Student *)a;
|
|
|
|
|
|
struct Student *student2 = (struct Student *)b;
|
|
|
|
|
|
|
|
|
|
|
|
if (student1->class_id != student2->class_id) {
|
|
|
|
|
|
return student1->class_id - student2->class_id;
|
|
|
|
|
|
} else {
|
|
|
|
|
|
float total_score1 = student1->score1 + student1->score2 + student1->score3;
|
|
|
|
|
|
float total_score2 = student2->score1 + student2->score2 + student2->score3;
|
|
|
|
|
|
return total_score2 - total_score1;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int main() {
|
|
|
|
|
|
struct Student students[100];
|
|
|
|
|
|
int num_students = 3; // <20><>ʼ<EFBFBD><CABC>3<EFBFBD><33>ѧ<EFBFBD><D1A7><EFBFBD><EFBFBD>Ϣ
|
|
|
|
|
|
|
|
|
|
|
|
// <20><>ʼ<EFBFBD><CABC><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ѧ<EFBFBD><D1A7><EFBFBD><EFBFBD>Ϣ
|
|
|
|
|
|
students[0] = (struct Student){10001, 11, 99.5, 88.5, 89.5};
|
|
|
|
|
|
students[1] = (struct Student){10002, 12, 77.9, 56.5, 87.5};
|
|
|
|
|
|
students[2] = (struct Student){10003, 11, 92.5, 99.0, 60.5};
|
|
|
|
|
|
|
|
|
|
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ѧ<EFBFBD><D1A7><EFBFBD><EFBFBD>Ϣ<EFBFBD><CFA2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
qsort(students, num_students, sizeof(struct Student), compareStudents);
|
|
|
|
|
|
|
|
|
|
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ѧ<EFBFBD><D1A7><EFBFBD><EFBFBD>Ϣ
|
|
|
|
|
|
struct Student new_student;
|
|
|
|
|
|
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ѧ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϣ<EFBFBD><EFBFBD>ѧ<EFBFBD><EFBFBD> <20>༶ <20>ɼ<EFBFBD>1 <20>ɼ<EFBFBD>2 <20>ɼ<EFBFBD>3<EFBFBD><33><EFBFBD><EFBFBD>");
|
|
|
|
|
|
scanf("%d %d %f %f %f", &new_student.student_id, &new_student.class_id, &new_student.score1, &new_student.score2, &new_student.score3);
|
|
|
|
|
|
|
|
|
|
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ѧ<EFBFBD><D1A7><EFBFBD><EFBFBD>Ϣ
|
|
|
|
|
|
students[num_students] = new_student;
|
|
|
|
|
|
num_students++;
|
|
|
|
|
|
|
|
|
|
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݽ<EFBFBD><DDBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
qsort(students, num_students, sizeof(struct Student), compareStudents);
|
|
|
|
|
|
|
|
|
|
|
|
for (int i = 0; i < num_students; i++) {
|
|
|
|
|
|
printf("%d %d %.1f %.1f %.1f", students[i].student_id, students[i].class_id, students[i].score1, students[i].score2, students[i].score3);
|
|
|
|
|
|
if (i == num_students - 2) {
|
|
|
|
|
|
printf(" inserted\n");
|
|
|
|
|
|
} else {
|
|
|
|
|
|
printf("\n");
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
