csp333

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

using namespace std;

// 拓扑排序函数
vector<string> topological_sort(int n, vector<string>& participants, vector<pair<string, string>>& matches) {
    unordered_map<string, vector<string>> graph;
    unordered_map<string, int> in_degree;
    
    // 初始化入度表
    for (const auto& name : participants) {
        in_degree[name] = 0;
    }

    // 构建图和计算入度
    for (const auto& match : matches) {
        string winner = match.first;
        string loser = match.second;
        graph[winner].push_back(loser);
        in_degree[loser]++;
    }

    // 队列用于存储入度为0的节点
    queue<string> zero_in_degree_queue;
    for (const auto& name : participants) {
        if (in_degree[name] == 0) {
            zero_in_degree_queue.push(name);
        }
    }

    vector<string> sorted_list;
    
    // 拓扑排序
    while (!zero_in_degree_queue.empty()) {
        string current = zero_in_degree_queue.front();
        zero_in_degree_queue.pop();
        sorted_list.push_back(current);

        for (const auto& neighbor : graph[current]) {
            in_degree[neighbor]--;
            if (in_degree[neighbor] == 0) {
                zero_in_degree_queue.push(neighbor);
            }
        }
    }

    // 如果排序的节点数小于n，说明图中有环
    if (sorted_list.size() < n) {
        cout << "图中有环，无法进行拓扑排序。" << endl;
        return {};
    }

    return sorted_list;
}

int main() {
    int n, m;
    cin >> n;

    vector<string> participants(n);
    for (int i = 0; i < n; ++i) {
        cin >> participants[i];
    }

    cin >> m;
    vector<pair<string, string>> matches(m);
    for (int i = 0; i < m; ++i) {
        cin >> matches[i].first >> matches[i].second;
    }

    vector<string> sorted_participants = topological_sort(n, participants, matches);

    for (const auto& participant : sorted_participants) {
        cout << participant << endl;
    }

    return 0;
}