[백준]1966-프린터 큐(설명X)

#include <iostream>
#include <queue>
using namespace std;
 
int main()
{
    int test_case;
    cin >> test_case;
    for (size_t i = 0; i < test_case; i++) {
        int N, position;
        cin >> N >> position;
        queue<pair<int, int>> que;
        priority_queue<int> priq;
        for (size_t j = 0; j < N; j++) {
            int priority;
            cin >> priority;
            que.push({ j, priority });
            priq.push(priority);
        }
        int count = 0;
        while (!que.empty()) {
            int idx = que.front().first;
            int priority = que.front().second;
            que.pop();
            if (priq.top() == priority) {
                count++;
                priq.pop();
                if (idx == position)
                    break;
            }
            else
                que.push({ idx, priority });
        }
        cout << count << endl;
    }
    return 0;
}