话题焦点人物

醉挽清风（Gavin）

于 2024-05-15 19:02:36 发布

阅读量151

点赞数 3

文章标签：算法数据结构

本文链接：https://blog.csdn.net/ZiGavin/article/details/138919764

版权

#include <stdio.h>
#include <stdbool.h>
 
#define MAX_USERS 100
#define MAX_POSTS 10000
 
int main() {
    int mentions[MAX_USERS] = {0};
    bool mentioners[MAX_USERS][MAX_USERS] = {false};
    int N, a, k, b;
 
    scanf("%d", &N);
 
    for (int i = 0; i < N; i++) {
        scanf("%d %d", &a, &k);
        for (int j = 0; j < k; j++) {
            scanf("%d", &b);
            mentions[b]++;
            mentioners[b][a] = true;
        }
    }
 
    int max_mentions = 0, max_user = 0;
    for (int i = 1; i < MAX_USERS; i++) {
        if (mentions[i] > max_mentions) {
            max_mentions = mentions[i];
            max_user = i;
        }
    }
 
    printf("%d\n", max_user);
 
    bool first = true;
    for (int i = 1; i < MAX_USERS; i++) {
        if (mentioners[max_user][i]) {
            if (!first) {
                printf(" ");
            }
            printf("%d", i);
            first = false;
        }
    }
    printf("\n");
 
    return 0;
}