代码练习

#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>

using namespace std;
int n, k;
string name;

unordered_map<string, vector<int>> lists;

int main(void) {
  scanf("%d %d", &n, &k);
  while (k--) {
    int id, num;
    scanf("%d %d", &id, &num);
    while (num--) {
      cin >> name;;
      lists[name].emplace_back(id);
    }
  }
  while (n--) {
    cin >> name;
    auto& courses = lists[name];
    sort(begin(courses), end(courses));
    printf("%s %d ", name.c_str(), courses.size());
    for (const auto& id : courses) printf("%d ", id);
    printf("\n");
  }
}