林泽楷

userId_undefined

180****5376

2025-11-01 19:57:18

发布于：浙江

0阅读
0回复
0点赞

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int heap[N],len;
void put(int x)
{
heap[len] = x;
int son = len;
while(son > 1)
{
int pa = son/2;
if(pa >= 1 && heap[pa] <= heap[son]) break;
swap(heap[son],heap[pa]);
son = pa;
}
}
int main()
{
int n;cin>>n;
for(int i = 1;i<=n;i)
{
int x;cin>>x;
put(x);
}
for(int i = 1;i<=len;i++) cout<<heap[i]<<" ";
return 0;
}

userId_undefined
去预览
0/2000
暂无数据

这里空空如也

热门讨论