//优先队列的插入与删除操作
#include<iostream>
using namespace std;
const int maxsize=100;
int a[maxsize];
void siftup(int v,int n)
{
if(n>=maxsize)
{
cout<<"error"<<endl;
return;
}
a[++n]=v;
for(int i=n;(i>1)&&(a[i/2]>a[i]);i/=2)
swap(a[i/2],a[i]);
}
int siftdown(int n)
{
if(n<1)
{
cout<<"error data&#
#include<iostream>
using namespace std;
const int maxsize=100;
int a[maxsize];
void siftup(int v,int n)
{
if(n>=maxsize)
{
cout<<"error"<<endl;
return;
}
a[++n]=v;
for(int i=n;(i>1)&&(a[i/2]>a[i]);i/=2)
swap(a[i/2],a[i]);
}
int siftdown(int n)
{
if(n<1)
{
cout<<"error data&#