[Programmers] (stack) Lv 2. 뒤에 있는 큰 수 찾기

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

프로그래머스

 

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

using namespace std;

using p = pair<int, int>;

vector<int> solution(vector<int> numbers) {
    vector<int> answer(numbers.size(), -1);
    stack<p> st;

    for (int i = 0; i < numbers.size(); ++i)
    {
        while (!st.empty() && st.top().second < numbers[i])
        {
            answer[st.top().first] = numbers[i];
            st.pop();
        }
        st.push(make_pair(i, numbers[i]));
    }
    return answer;
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/commit/644d21a44e6a859387dc191e92dd4ace6b181ea5

[unrated] Title: 뒤에 있는 큰 수 찾기, Time: 333.34 ms, Memory: 240 MB -Baekj… · developeSHG/Algorithm-Baekjoon_Progr