QSorting一个malloc的结构数组？

#include<stdio.h>
#include <stdlib.h>

// 定义结构体
typedef struct {
    int id;
    char name[20];
} Student;

// 比较函数，用于qsort排序
int cmp(const void *a, const void *b) {
    Student *s1 = (Student *)a;
    Student *s2 = (Student *)b;
    return s1->id - s2->id;
}

int main() {
    int n = 5;
    Student *students = (Student *)malloc(n * sizeof(Student));

    // 初始化结构数组
    for (int i = 0; i < n; i++) {
        students[i].id = i + 1;
        sprintf(students[i].name, "Student %d", i + 1);
    }

    // 使用qsort对结构数组进行排序
    qsort(students, n, sizeof(Student), cmp);

    // 输出排序后的结构数组
    for (int i = 0; i < n; i++) {
        printf("ID: %d, Name: %s\n", students[i].id, students[i].name);
    }

    // 释放内存
    free(students);

    return 0;
}