1966번: 프린터 큐

#include<cstdio>
#include <queue>
using namespace std;
int main()
{
    queue<int> q; priority_queue<int> pq;
    int t, n, m, paper, ans = 0, pos, now;
    for (scanf("%d", &t); t--; ans = 0)
    {
        scanf("%d %d", &n, &m);
        pos = m;
        now = n;
        for (int i = 0; i < n; ++i)
        {
            scanf("%d", &paper);
            q.push(paper);
            pq.push(paper);
        }
        while (!q.empty())
        {
            if (pq.top() == q.front())
            {
                
                ++ans;
                if (pos == 0)
                    break;
                pq.pop();
                q.pop();
                --now;
                pos -= 1;
            }
            else
            {
                if (pos == 0)
                {
                    pos = now - 1;
                    q.push(q.front());
                    q.pop();
                }
                else
                {
                    pos -= 1;
                    q.push(q.front());
                    q.pop();
                }
            }
        }
        printf("%d\n", ans);
        while (!q.empty())
            q.pop();
        while (!pq.empty())
            pq.pop();
    }
}