题解 | 小苯送礼物

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

typedef struct{
    long long id, li, sup, col;     //编号（小），点赞量，支持量，收藏量
}fan;

int compare1(const void*a, const void*b){
    const fan*ca = (fan*)a;
    const fan*cb = (fan*)b;
    if(cb -> sup != ca -> sup)
        return cb -> sup - ca -> sup;
    if(ca -> col != cb -> col)
        return cb -> col - ca -> col;
    return ca -> id - cb -> id;
}

int compare2(const void*a, const void*b){
    return(*(int*)a - *(int*)b);
}

int main(void) {
    int n, k;   //有的粉丝数和选择送礼数
    scanf("%d%d", &n, &k);

    fan fans[n];
    for(int i = 0; i < n; i++){
        int like, collection;
        scanf("%d%d", &like, &collection);

        fans[i].id = i+1;
        fans[i].li = like;
        fans[i].col = collection;
        fans[i].sup = like + 2 * collection;
    }

    qsort(fans, n, sizeof(fan), compare1);

    int identity[k];
    for(int i = 0; i < k; i++)
        identity[i] = fans[i].id;
    
    qsort(identity, k, sizeof(int), compare2);

    for(int i = 0; i < k; i++)
        printf("%d ", identity[i]);

    return 0;
}