[프로그래머스 3] 이중 우선순위 큐 (C/C++)

#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
using namespace std;
 
vector<int> solution(vector<string> operations) 
{
    vector<int> answer;
    vector<int> q;
    
    for(int i = 0; i < operations.size(); i++)
    {
        if(operations[i][0] == 'I')
        {
            string num = operations[i].substr(2, operations.size()-2);
            q.push_back(stoi(num));
        }
        else if(operations[i][0] == 'D')
        {
            if(q.size() == 0)
            {
                continue;
            }
            
            if(operations[i][2] == '1')
            {
                // 오름차순
                sort(q.begin(), q.end());
                q.pop_back();
            }
            else if(operations[i][2] == '-')
            {
                // 내림차순
                sort(q.begin(), q.end(), greater<int>());
                q.pop_back();
            }
        }  ;
    }
    
    if(q.size() == 0)
    {
        answer.push_back(0);
        answer.push_back(0);
    }
    else
    {
        // 오름차순
        sort(q.begin(), q.end());
        answer.push_back(q[q.size()-1]);
        answer.push_back(q[0]);
    }
    
    return answer;
}