[C/C++] 백준 1927

문제 소스 코드 #include <iostream> #include <vector> using namespace std; #define MAX_HEAPSIZE 100001 #define EMPTY_HEAP(n) (!n) #define FULL_HEAP(n) (n == MAX_HEAPSIZE - 1) int min_heap[MAX_HEAPSIZE] = {0}; int cursor = 0; void push(int key) { if(FULL_HEAP(cursor)) return; int i = ++cursor; while(i != 1 && min_heap[i/2] > key) { min_heap[i] = min_heap[i/2]; i /= 2; } min_heap[i] = key; } void pop() { if(EMPTY_HEAP(cursor)) return; int parent = 1; int child = 2; min_heap[1] = min_heap[cursor]; min_hea...

원문링크 : [C/C++] 백준 1927