[Programmers] Lv 2. 택배상자

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

프로그래머스

 

#include <string>
#include <vector>
#include <queue>
#include <stack>

using namespace std;

int solution(vector<int> order) {
    int answer = 0;
    stack<int> s;
    priority_queue<int, vector<int>, greater<int>> q(order.begin(), order.end());

   for (size_t i = 0; i < order.size();)
    {
        const auto find = order[i];
        if (find < q.top() && !s.empty() && find != s.top()) break;

        if (!s.empty() && find == s.top()) s.pop(), ++i, ++answer;
        else if (find == q.top()) q.pop(), ++i, ++answer;
        else
        {
            if (find > q.top())
            {
                s.push(q.top());
                q.pop();
            }
        }
    }

    return answer;
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/commit/44b462ca8e82ec2ec061d159fe21cdacbfa0cdb4

[level 2] Title: 택배상자, Time: 88.68 ms, Memory: 42.2 MB -BaekjoonHub · developeSHG/Algorithm-Baekjoon_Programmers@44b462