zi_wan的博客

此题为堆排的简单运用#include<cstdio>#include<iostream>using namespace std;int ans,s,hp[10005],n,siz,cnt;void pus(int x)//输（插）入 {cnt++;hp[cnt]=x;int now=cnt;int fa=cnt/2;while(now>1){if(hp[now]&gt...

#include<cstdio> #include<iostream> using namespace std; int hp[105],n,siz; void push(int x)//输（插）入 { if(hp[x]>=hp[x/2]) return; else { int a=hp[x]; hp[x]=hp[x/2]; hp[x/2]=...