题解 | #牛牛的书#
牛牛的书
https://www.nowcoder.com/practice/30bb969e117b4f6d934d4b60a2af7489
#include <stdio.h>
#include<stdlib.h>
typedef struct book {
    char name[20];
    int price;
} book;
int sort(const void* p1, const void* p2) {
    return ((book*)p1)->price - ((book*)p2)->price;
}
int main() {
    int n = 0;
    scanf("%d", &n);
    book* pb = malloc(n * sizeof(book));
    for (int i = 0; i < n; i++) {
        scanf("%s %d", pb[i].name, &(pb[i].price));
    }
    qsort(pb, n, sizeof(book), sort);
    for (int i = 0; i < n; i++) {
        printf("%s\n", pb[i].name);
    }
    free(pb);
    pb=NULL;
    return 0;
}
 查看2道真题和解析
查看2道真题和解析

