[Programmers] (스택/큐) Lv 2. 프로세스

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

프로그래머스

 

#include <string>
#include <vector>
#include <deque>
#include <algorithm>

using namespace std;

int solution(vector<int> priorities, int location) {
    int answer = 0;

    deque<pair<int, int>> q;
    for (int i = 0; i < priorities.size(); ++i)
        q.emplace_back(make_pair(i, priorities[i]));
    
    auto max = *max_element(q.begin(), q.end(), [](pair<int, int> a, pair<int, int> b) { return a.second < b.second; });
    while (true)
    {  
        auto pp = q.front();
        q.pop_front();

        if (pp.second == max.second)
        {
            ++answer;
            if (pp.first == location) break;

            max = *max_element(q.begin(), q.end(), [](pair<int, int> a, pair<int, int> b) { return a.second < b.second; });
        }
        else
            q.emplace_back(pp);
    }

    return answer;
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/blob/c116b2af9f9929e60a825a91fd98d0d8538f7c4a/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/42587.%E2%80%85%ED%94%84%EB%A1%9C%EC%84%B8%EC%8A%A4/%ED%94%84%EB%A1%9C%EC%84%B8%EC%8A%A4.cpp

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드