AcWing 838.. 推排序
原题链接
简单
作者:
Chandler丶
,
2024-02-28 17:06:14
,
所有人可见
,
阅读 17
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <string>
#include <queue>
using namespace std;
#define ll long long
const int N =100010;
int n ,m,size;
int h[N];
void down(int u)
{
int t = u;
if(u *2 <= size && h[u * 2] < h[t]) t = u * 2;
if(u * 2 + 1 <= size && h[u * 2 + 1] < h[t]) t = u * 2 +1;
if( u != t)
{
swap( h[u], h[t]);
down(t);
}
}
int main()
{
scanf("%d%d",&n,&m);
for(int i =1;i <= n; i++) scanf("%d",&h[i]);
size = n;
for(int i = n /2; i ; i--) down(i);
while(m--)
{
printf("%d ",h[1]);
h[1] = h[size];
size -- ;
down(1);
}
}