题解 | #牛牛的书#

牛牛的书

https://www.nowcoder.com/practice/30bb969e117b4f6d934d4b60a2af7489

#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include <stdlib.h>
typedef struct Book
{
    char name[100];
    int price;
}Book;
int cmp_by_price(const void* e1, const void* e2)//psort排序
{
    Book* s1 = (Book*)e1;
    Book* s2 = (Book*)e2;
    return s1->price - s2->price;
}
int main()
{
    int n = 0;
    scanf("%d", &n);
    Book arr[50];
    for (int i = 0; i < n; i++)
    {
	scanf("%s %d", &arr[i].name, &arr[i].price);
    }
    int sz = sizeof(arr) / sizeof(arr[0]);
    qsort(arr, n, sizeof(arr[0]),cmp_by_price);//快排
    for (int i = 0;i < n;i++)
    {
	printf("%s\n", arr[i].name);
    }

    return 0;
}

全部评论

相关推荐

评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务