二叉堆练习3

 1 #include<iostream>
 2 #include<cstdio>
 3 using namespace std;
 4 int n,a,b,c,dp,ado,rec;
 5 int heap[600000];//數組要開的大一些。
 6 void put(int x){
 7     ++dp;
 8     heap[dp]=x;
 9     rec=dp;
10     while(rec>1){
11         if(heap[rec]<heap[rec/2]){
12             swap(heap[rec],heap[rec/2]);
13             rec/=2;
14         }
15         else break;
16     }
17 }
18 int get(){
19     int d=1,e;
20     rec=heap[d];
21     heap[d]=heap[dp];
22     dp--;
23     while(d*2<=dp){
24         if(heap[d*2]>heap[d*2+1]) c=d*2+1;
25         else c=d*2;
26         if(heap[d]>heap[c]){
27             swap(heap[d],heap[c]);
28             d=c;
29         }
30         else break;
31     }
32     return rec;
33 }
34 int main(){
35     cin>>n;
36     for(int i=1;i<=n;i++){
37         cin>>a;
38         put(a);
39     }
40     for(int i=1;i<=n;i++) printf("%d ",get());
41     return 0;
42 }