题目:https://www.patest.cn/contests/pat-a-practise/1047
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn = 40010;
const int maxc = 2510;
char name[maxn][5];
vector<int> course[maxc];
bool cmp(int a, int b)
{
return strcmp(name[a],name[b])<0;
}
int main()
{
int N=0,K=0,C=0,course_id=0;;
scanf("%d%d",&N,&K);
for(int i=0; i<N; i++)
{
scanf("%s",name[i]);
scanf("%d",&C);
for(int j=0; j<C; j++)
{
scanf("%d",&course_id);
course[course_id].push_back(i);
}
}
for(int i=1; i<=K; i++)
{
printf("%d %d\n",i,course[i].size());
sort(course[i].begin(),course[i].end(),cmp);
for(int j=0; j<course[i].size(); j++)
printf("%s\n",name[course[i][j]]);
}
return 0;
}