优先级队列

#include <iostream>
using namespace std;
int n,h[101];
//交换函数
void sawp(int x, int y)
{
int t;
t = h[x];
h[x] = h[y];
h[y] = t;
}


//向下排序
void siftdown(int i)
{
int t, flag = 0;
while (i * 2 <= n&&flag == 0)
{
if (h[i] < h[2 * i])
t = 2 * i;
else
t = i;
if (2 * i + 1 <= n)
{
if (h[t] < h[2 * i + 1])
t = 2 * i + 1;
}
if (t != i)
{
sawp(t, i);
i = t;
}
else
flag = 1;
}
}


//创建堆函数
void create()
{
for (int i = n / 2; i >=1; i--)
siftdown(i);
return;
}


//排序函数
void sort()
{
while (n > 1)
{
sawp(1,n);
n--;
siftdown(1);
}
}
 int main()
{
int m;
cout<<"输入堆的节点数"<<endl;
cin >> m;
n = m;
cout << "输入堆中各个节点的值"<<endl;
for (int i = 1; i <= m; i++)
cin>>h[i];
create();
sort();
for (int i = 1; i <=m; i++)
     cout << h[i] << " ";
cout << endl;
return 0;
}