[c++] 이중우선순위큐

#include <string>
#include <vector>
#include <queue>
using namespace std;
 
 
vector<int> solution(vector<string> operations) {
    vector<int> answer;
    priority_queue<int> pq1; // max-heap
    priority_queue<int, vector<int>, greater<int>> pq2; // min-heap
    int cnt = 0;
 
    for(int i=0;i<operations.size();i++){
        //삽입
        if(operations[i][0]=='I'){
            string number=operations[i].substr(2);
            int num=stoi(number);
            pq1.push(num);
            pq2.push(num);
            cnt++;
        }
        else if(operations[i][0]=='D' && cnt>0){
            //최댓값 삭제
            if(operations[i][2]=='1'){
                pq1.pop();
            }
            //최솟값 삭제
            else{   
                pq2.pop();
            }
            cnt--;
            if (cnt == 0){
                while(!pq1.empty()){
                    pq1.pop();
                }
                while(!pq2.empty()){
                    pq2.pop();
                }
            }
        }   
    }
    if(cnt == 0){
        answer.push_back(0);
        answer.push_back(0);
    }
    else{
        answer.push_back(pq1.top());
        answer.push_back(pq2.top());
    }
 
    return answer;
}