Team Queue

两个队列  一个队列放优先级，一个队列放优先级里的数，顺便用的了map 确定数在哪个优先级里

#include <iostream>
using namespace std;
#include<string.h>
#include<stdio.h>
#include<queue>
#include<map>
int main()
{

    int t,m,i,n,add=0;
    while(cin>>t,t)
    {
        cout<<"Scenario #"<<++add<<endl;
        map<int,int>a;
    for(i=0;i<t;i++)
    {
        cin>>m;
        while(m--)
        {
            cin>>n;
            a[n]=i;
        }
    }
    queue<int > team;
    queue<int > team1[1010];
    char CNM[10];
    int mmp;
    while(cin>>CNM)
    {
        if(CNM[0]=='S')
            break;
        else if(CNM[0]=='D')
        {
            int t=team.front();
            cout<<team1[t].front()<<endl;
            team1[t].pop();
            if(team1[t].empty())
                team.pop();
        }
        else if(CNM[0]=='E')
        {
            cin>>mmp;
            int zxc=a[mmp];
            if(team1[zxc].empty())
                team.push(zxc);
            team1[zxc].push(mmp);
        }
    }
    cout<<endl;
    }
    return 0;
}