(11279) 최대 힙

https://www.acmicpc.net/problem/11279

단계별로 풀어보기

26단계(우선순위 큐) 1번째

 

 

 

#include <iostream>
#include <queue>
using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  
  int n;
  
  cin >> n;
  
  priority_queue<int> pq;
  
  while(n--){
    int t;
    
    cin >> t;
    
    if(t){
      pq.push(t);
    }else{
      if(!pq.empty()){
        cout << pq.top() << "\n";
        pq.pop();
      }else{
        cout << "0\n";
      }
    }
  }
  
  return 0;
}