#include <iostream>
#include <cstdlib>
using namespace std;
#define mindata -12345//哨兵元素的值
#define maxsize 112345
int num[123456];
struct node
{
int *p;
int sizedata;//所建堆的大小
int length;//堆的最大存储空间;
};
int IsFull(struct node *H)//最小堆的初始化
{
return (H->sizedata==H->length)?1:0;
}
int IsEmpty(struct node *H)//判断堆是为空
{
return (H->sizedata==0)?1:0;
}
struct node *Init_MinHeap()//堆的初始化
{
struct node *H=(struct node *)malloc(sizeof(struct node));
H->p=(int *)malloc((maxsize+1)*sizeof(int));
H->p[0]=mindata;
H->sizedata=0;
H->length=maxsize;
return H;
}
void Insert(struct node *H,int data)
{
int i;
if(IsFull(H))
return ;
else
{
for(i=(++H->sizedata); data<H->p[i/2]; i=i/2) //自底向上插入元素
H->p[i]=H->p[i/2];
H->p[i]=data;
}
}
int Delete(struct node *H)
{
int minvalue,lastvalue,child,parent;
if(IsEmpty(H))
{
return -999999;
}
minvalue=H->p[1];//记录最小值
lastvalue=H->p[H->sizedata--];//lastvalue等于最后一个元素,堆的大小减一
for(parent=1; 2*parent<=H->sizedata; parent=child) //更新堆
{
child=2*parent;//默认左节点的元素值更小
if(child!=H->sizedata&&H->p[child+1]<H->p[child])
child++;
if(lastvalue<H->p[child])
break;
else
H->p[parent]=H->p[child];
}
H->p[parent]=lastvalue;
return minvalue;
}
void BuildMinHeap(struct node *H,int N)
{
int i,parent,child,root,lastvalue;
for(i=1; i<=N; i++)
{
cin>>H->p[i];
}
H->sizedata=N;
root=N/2;
while(root)
{
lastvalue=H->p[root];
for(parent=root; 2*parent<=H->sizedata; parent=child)
{
child=2*parent;//默认左节点的值更小;
if(child!=H->sizedata&&H->p[child+1]<H->p[child])
child++;
//cout<<child<<endl;
if(H->p[child]>lastvalue)
break;
else
H->p[parent]=H->p[child];
}
H->p[parent]=lastvalue;
//cout<<H->p[parent]<<' ';
--root;
}
}
int main()
{
int N,o=0,i;
struct node *H;
cin>>N;
H=Init_MinHeap();
BuildMinHeap(H,N);
while(H->sizedata)
num[o++]=Delete(H);
for(i=0;i<o;i++)
{
if(i==o-1)
cout<<num[i]<<endl;
else
cout<<num[i]<<' ';
}
return 0;
}
#include <cstdlib>
using namespace std;
#define mindata -12345//哨兵元素的值
#define maxsize 112345
int num[123456];
struct node
{
int *p;
int sizedata;//所建堆的大小
int length;//堆的最大存储空间;
};
int IsFull(struct node *H)//最小堆的初始化
{
return (H->sizedata==H->length)?1:0;
}
int IsEmpty(struct node *H)//判断堆是为空
{
return (H->sizedata==0)?1:0;
}
struct node *Init_MinHeap()//堆的初始化
{
struct node *H=(struct node *)malloc(sizeof(struct node));
H->p=(int *)malloc((maxsize+1)*sizeof(int));
H->p[0]=mindata;
H->sizedata=0;
H->length=maxsize;
return H;
}
void Insert(struct node *H,int data)
{
int i;
if(IsFull(H))
return ;
else
{
for(i=(++H->sizedata); data<H->p[i/2]; i=i/2) //自底向上插入元素
H->p[i]=H->p[i/2];
H->p[i]=data;
}
}
int Delete(struct node *H)
{
int minvalue,lastvalue,child,parent;
if(IsEmpty(H))
{
return -999999;
}
minvalue=H->p[1];//记录最小值
lastvalue=H->p[H->sizedata--];//lastvalue等于最后一个元素,堆的大小减一
for(parent=1; 2*parent<=H->sizedata; parent=child) //更新堆
{
child=2*parent;//默认左节点的元素值更小
if(child!=H->sizedata&&H->p[child+1]<H->p[child])
child++;
if(lastvalue<H->p[child])
break;
else
H->p[parent]=H->p[child];
}
H->p[parent]=lastvalue;
return minvalue;
}
void BuildMinHeap(struct node *H,int N)
{
int i,parent,child,root,lastvalue;
for(i=1; i<=N; i++)
{
cin>>H->p[i];
}
H->sizedata=N;
root=N/2;
while(root)
{
lastvalue=H->p[root];
for(parent=root; 2*parent<=H->sizedata; parent=child)
{
child=2*parent;//默认左节点的值更小;
if(child!=H->sizedata&&H->p[child+1]<H->p[child])
child++;
//cout<<child<<endl;
if(H->p[child]>lastvalue)
break;
else
H->p[parent]=H->p[child];
}
H->p[parent]=lastvalue;
//cout<<H->p[parent]<<' ';
--root;
}
}
int main()
{
int N,o=0,i;
struct node *H;
cin>>N;
H=Init_MinHeap();
BuildMinHeap(H,N);
while(H->sizedata)
num[o++]=Delete(H);
for(i=0;i<o;i++)
{
if(i==o-1)
cout<<num[i]<<endl;
else
cout<<num[i]<<' ';
}
return 0;
}