Team Queue UVA - 540

Team Queue UVA - 540

#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;
const int maxt=1000+10;
int main()
{
	int t,kase=1;
	while(cin>>t&&t)
	{
		cout<<"Scenario #"<<kase++<<endl;
		map<int ,int> IDteam;
		int n,eme;
		for(int k=1;k<=t;k++)
		{
			cin>>n;
			for(int i=1;i<=n;i++)
			{
				cin>>eme;
				IDteam[eme]=k;
			}
		}
		queue<int> team[maxt],queue1;
		while(1)
		{
			string op;
			int id;
			cin>>op;
			if(op[0]=='E')
			{
				cin>>id;
				int u=IDteam[id];
				if(team[u].empty())queue1.push(u);
				team[u].push(id);
			}
			if(op[0]=='D')
			{
				int u=queue1.front();
				cout<<team[u].front()<<endl;
				team[u].pop();
				if(team[u].empty())queue1.pop();
			}
			if(op[0]=='S')break;
		}
		cout<<endl;
	}
	return 0;
 }