堆排序

#include<iostream>
#include<algorithm>
using namespace std;
const int N=100010;
int n,m;
int h[N],size;
void down(int u)
{
int t=u;
if(u*2<=size&&h[u*2]<h[t])t=u*2;
if(u*2+1<=size&&h[u*2+1]<h[t])t=u*2+1;
if(u!=t)
{
swap(h[u],h[t]);
down(t);
}
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%d",&h[i]);
size=n;
for(int i=n/2;i;i++)odwn(i);
while(m--)
{
printf("%d ",h[1]);
h[1]=h[size];
size--;
down(1);
}
return 0;
}