题解 | #牛牛的书#
牛牛的书
https://www.nowcoder.com/practice/30bb969e117b4f6d934d4b60a2af7489
#include <stdio.h> #include <stdlib.h> typedef struct { char name[100]; int price; }book; int down(const void* a, const void* b) { return (((book*)a)->price) - (((book*)b)->price); } int main() { int n = 0; scanf("%d", &n); book arr[10] = { 0 }; int i = 0; for( i=0;i<n;i++) { scanf("%s %d", &arr[i].name, &arr[i].price); } qsort(arr, n,sizeof(book), down); for (int i = 0;i < n;i++) { printf("%s\n", arr[i].name); } return 0; }