UVA 12100 Printer Queue

#include<bits/stdc++.h>

struct prtjob
{
    int pos,pty;
}job;

int t,n,m,ans;
int main(void)
{
    scanf("%d",&t);
    while(t--)
    {
        queue<prtjob> q;
        map<int,int> mp;
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;i++){
            scanf("%d",&job.pty);
            job.pos=i;
            q.push(job);
            mp[job.pty]++;
        }
        ans=0;
        while(!q.empty())
        {
            if(q.front().pty < mp.rbegin()->first)
            {
                q.push(q.front());
                q.pop();
            }
            else if(q.front().pos==m) break;
            else
            {
                if (mp[q.front().pty] == 1) 
                    mp.erase(q.front().pty); 
                else 
                    mp[q.front().pty] --;
                q.pop(); 
                ans ++;
            }
        }
        printf("%d\n",ans+1);
    }

    return 0;
}