UVA - 12100 Printer Queue【优先队列+队列】

#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
struct Node{
 int order;
 int pri;
 bool operator < (const Node b) const{
  return pri < b.pri;
 }
};
int main()
{
    int T;
    cin >> T;
    while(T--)
    {
        int n, m;
        cin >> n >>m;
        queue<Node> q;
        priority_queue<Node> pq;
        Node x;
        for (int i = 0; i < n; i++)
        {
            cin >> x.pri;
            x.order = i;
            q.push(x);
            pq.push(x);
        }
        int cnt = 0;
        while(true)
        {
            if(pq.top().pri == q.front().pri)
            {
                cnt++;
                x = q.front();
                pq.pop();
                q.pop();
                if(x.order == m) break;
            }
            else{

                q.push(q.front());
                q.pop();
            }
        }
        cout << cnt <<endl;

    }

}