백준 1966번 : 프린터 큐

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;

    for (int i = 0; i < N; i++)
    {
        int M, Q;
        cin >> M >> Q;

        queue<pair<int, int>> tasks;
        priority_queue<int> maxHeap;

        for (int j = 0; j < M; j++)
        {
            int num;
            cin >> num;
            tasks.emplace(num, j);
            maxHeap.push(num);
        }

        int answer = 0;

        while (true)
        {
            int value = tasks.front().first;
            int index = tasks.front().second;
            tasks.pop();

            if (value == maxHeap.top())
            {
                maxHeap.pop();
                answer++;

                if (index == Q)
                {
                    cout << answer << "\n";
                    break;
                }
            }
            else
            {
                tasks.emplace(value, index);
            }
        }
    }

    return 0;
}