团体队列（UVa540）

　　

　　题目具体描述见：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=481

C++11代码如下：

#include<iostream>
#include<map>
#include<string>
#include<queue>
using namespace std;

const int maxn = 1010;

int main() {
    int t, k = 0;
    while ((cin >> t) && t ) {
        cout << "Scenario #" << ++k << endl;
        queue<int>q, q2[maxn];
        map<int, int>team;

        for(int i=1;i<=t;i++) {
            int n, m;
            cin >> n;
            while (n--) {
                cin >> m;
                team[m] = i;
            }            
        }
        for (;;) {
            string cmd; int x;
            cin >> cmd;
            if (cmd[0] == 'S') break;
            else if (cmd[0] == 'E') {
                cin >> x;
                int k = team[x];
                if (q2[k].empty()) q.push(k);
                q2[k].push(x);
            }
            else if (cmd[0] == 'D') {                
                int d = q.front();
                int num = q2[d].front(); q2[d].pop();
                if (q2[d].empty()) q.pop();
                cout << num << endl;
            }
        }
        cout << endl;
    }
    return 0;
}