Topological Sort

Write an application to output a topologically ordered list of tasks/events

Input

• The first line will contain the single number $1 \leq N \leq 30$, the number of tasks/events
• The next $N$ lines will contain a description of each task/event. No description is longer than 50 characters.
• The remaining lines will contain two numbers $s_i$ and $d_i$ ($0 \leq s_i, d_i \lt N$) which represents that task $s_i$ has to occur before task $d_i$.
  • Tasks are numbered from $0$ to $N-1$

Note, to scan until the end of file use

    while (scanf("%d%d", &a, &b) != EOF) {
        // code
    }

or with c++ i/o

    while (cin >> src >> dst){
        // code
    }