堆排序

#include<iostream>
using namespace std;
int heap[101];
int heap_size;
void put(int d)                 //heap[1]为堆顶   插入 
{
    int now, next;
    heap[++heap_size] = d;
    now = heap_size;
    while(now > 1)
    {
        next = now/2;// 父节点 
        if(heap[now] >= heap[next]) 
        break;
        swap(heap[now], heap[next]);
        now = next;
    }
}
int get()                //heap[1]为堆顶  获取 
{
    int now=1, next, res= heap[1];
    heap[1] = heap[heap_size--];//取出末尾元素 
    while(now * 2 <= heap_size)
    {
        next = now * 2;// next 左孩子 
        if (next < heap_size && heap[next + 1] < heap[next])
        next++;
        if (heap[now] <= heap[next]) 
        break;
        swap(heap[now], heap[next]);
        now = next;
    }
    return res;
}

int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int dr;
        cin>>dr;
        put(dr);
    }
    for(int i=1;i<=n;i++)
    {
        cout<<get()<<endl;
    }
    return 0;
}

 stl

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int a[10000001];
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        //cin>>a[i];
        scanf("%d",&a[i]);
    }
    make_heap(a+1,a+n+1);
    sort_heap(a+1,a+n+1);
    for(int i=1;i<=n;i++)
    {
        //cout<<a[i]<<endl;
        printf("%d\n",a[i]);
    }
    return 0;
}