스택/큐 > 프린터

https://programmers.co.kr/learn/courses/30/lessons/42587

1. 문제

2. 알고리즘

키워드 - 우선순위큐

3. 코드

#include <string>
#include <vector>
#include <queue>
#include <algorithm>
 
using namespace std;
 
int solution(vector<int> priorities, int location) {
    int answer = 0;
    int count = 0;
    
    queue<pair<int, int>> q;
    priority_queue <int> pq;
 
    for (int i = 0; i < priorities.size(); i++) {
        q.push(make_pair(i, priorities[i]));
        pq.push(priorities[i]);
    }
    
    while (!q.empty()) {
        int c_index = q.front().first;
        int c_value = q.front().second;
        q.pop();
 
        if (pq.top() == c_value) {
            pq.pop();
            count++;
            if (c_index == location) {
                answer = count;
                break;
            }
        }
        else {
            q.push(make_pair(c_index, c_value));
        }
    }
    return answer;
}