레야몬

#include #define SWAP(x, y) do{int tmp; tmp=x; x=y; y=tmp;}while(0) #define MAX_N 100000 typedef struct _heap { //힙 구조체 int arr[MAX_N]; int size; } heap; heap h; void insert(heap* hp, int data) //힙 넣기 { int here = ++hp->size; while((here!=1) && (dataarr[here/2])) { hp->arr[here] = hp->arr[here/2]; here/=2; } hp->arr[here] = data; } int deleteData(heap *hp) //힙 꺼내기 { if(!hp->size) return 0; int r..