baekjun 1966. printerQueue

 겹치는 docs cost를 고려해서 queue를 사용하는 문제

#include <iostream>
#include <list>
#include <algorithm>
 
using namespace std;
 
int main() {
    int cases;
    cin >> cases;
    while (cases--) {
        int N, T;
        cin >> N >> T;
        list<pair<int, bool>> docs;
        list<int> maxDocs;
        for (int i = 0; i < N; i++) {
            int val;
            cin >> val;
            if (i == T) {
                docs.push_back(make_pair(val, true));
            } else {
                docs.push_back(make_pair(val, false));
            }
            maxDocs.push_back(val);
        }
        maxDocs.sort();
        int cnt = 0;
        while (!docs.empty()) {
            if (docs.front().first < maxDocs.back()) {
                docs.push_back(docs.front());
                docs.pop_front();
            } else {
                cnt++;
                if (docs.front().second) {
                    cout << cnt << "\n";
                    break;
                }
                maxDocs.pop_back();
                docs.pop_front();
            }
        }
    }
    //system("pause");
    return 0;
}