프로그래머스: 이중우선순위 큐

우선순위 큐 두개를 이용해 풀었다.

#include <string>
#include <vector>
#include <queue>
#include<iostream>
#include<algorithm>
using namespace std;

vector<int> solution(vector<string> operations) {
    vector<int> answer;
    priority_queue<int , vector<int>, greater<int> > minq;
    priority_queue<int , vector<int> , less<int> > maxq;
    int index = 0;
    for(auto i : operations){
        if(i[0] == 'I'){
            string num = i.substr(2);
            minq.push(stoi(num));
            index ++;
        }
        if(index>0&&i == "D 1"){ //최댓값삭제
            while(!minq.empty()){
                maxq.push(minq.top());
                minq.pop();
            }
            maxq.pop();
            while(!maxq.empty()){
                minq.push(maxq.top());
                maxq.pop();
            }
            index--;
        }
        if(index>0&&i=="D -1"){
            minq.pop();
            index--;
        }
    }
    if(minq.empty()){
        answer.push_back(0);
        answer.push_back(0);
        return answer;
    }
    answer.push_back(minq.top());
    while(minq.size()!=1){
        minq.pop();
    }
    answer.push_back(minq.top());
    reverse(answer.begin(),answer.end());
    return answer;
}