1047. Student List for Course (25)

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>
using namespace std;
const int maxn=1e5+10;
struct stu{
    char name[5];
};
bool cmp(stu a,stu b){
    return strcmp(a.name,b.name)<0;
}
int n,k;
int main(){
   // freopen("E://PAT/input.txt", "r", stdin);
    scanf("%d %d",&n,&k);
    vector<stu> co[k+1];
    stu s;
    for(int i=1;i<=n;i++){
        scanf("%s",s.name);
        int c;
        scanf("%d",&c);
        while(c--){
            int tmp;
            scanf("%d",&tmp);
            co[tmp].push_back(s);
        }
    }
    for(int i=1;i<=k;i++){
        printf("%d %d\n",i,co[i].size());
        sort(co[i].begin(),co[i].end(),cmp);
        for(int j=0;j<co[i].size();j++)
            printf("%s\n",co[i][j].name);
    }
    return 0;
}