Codevs

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int x,n,m,heap[1000],heap_size;
void put()
{// 小根堆的插入   插入到堆底 向上维护 
    int now,next;
    heap[++heap_size]=x;
    now=heap_size;
    while(now>1)
    {
        next=now/2;
        if(heap[next]<=heap[now]) return;
        swap(heap[now],heap[next]); 
        now=next;
    }
}
int get()
{
    int now=1,next,res;
    res=heap[1];
    heap[1]=heap[heap_size--];
    while(now*2<=heap_size)
    {
        next=now*2;
        if(next<heap_size&&heap[next+1]<heap[next]) next++;
        if(heap[now]<=heap[next]) return res;
        swap(heap[now],heap[next]);
        now=next;
    } 
    return res;
}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
      scanf("%d",&x),put();
    for(int i=1;i<=n;i++)
      printf("%d ",get()); 
    return 0;
    
    return 0;
}