UVA_12100: Printer Queue

#include <iostream>
#include <queue>
#include <algorithm>
#include <cstdio>
#include <utility>

using namespace std;

typedef pair<int,int> id_pri;
int pri[110];

bool cmp(int a, int b)
{
return a>b;
}

int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n,self;
scanf("%d%d",&n,&self);
queue<id_pri> idq;
for(int i=0; i<n; i++)
{
id_pri ip;
scanf("%d",&pri[i]);
ip = make_pair(i,pri[i]);
idq.push(ip);
}
sort(pri,pri+n,cmp);

queue<int> priq;
for(int i=0; i<n; i++)
priq.push(pri[i]);

int tm = 0;
while(1)
{
id_pri id = idq.front();
while(id.second<priq.front())
{
idq.pop();
idq.push(id);
id = idq.front();
}
tm++;
if(id.first == self)break;
idq.pop(); priq.pop();
}
cout << tm << endl;
}
return 0;
}