模板，堆，小根堆

#include<iostream>#include<cstdio>using namespace std;int n,x,y,z,a,b,c,hp[1005];void pus(int l){a++;hp[a]=l;b=a;while(b>1){if(hp[b]<hp[b/2]){swap(hp[b],hp[b/2]);b=b/2;}else{break;}}}//void wh()//{//int a=1;//}int main(){cin>>n;for(int a=1;a<=n;a++){cin>>x;pus(x);}for(int a=1;a<=n;a++){cout<<hp[a]<<" ";}cout<<endl;//swap(hp[n],hp[1]);//hp[n]=0;//n=n-1;//wh();}