AcWing 1588. 插入还是堆排序
原题链接
中等
作者:
RainSure
,
2022-02-25 17:49:59
,
所有人可见
,
阅读 121
#include<iostream>
#include<cstring>
using namespace std;
const int maxn = 110;
int a[maxn], b[maxn];
int n;
void down(int u, int Size)
{
int t = u;
while(u * 2 <= Size && b[u * 2] > b[t]) t = u * 2;
while(u * 2 + 1 <= Size && b[u * 2 + 1] > b[t]) t = u * 2 + 1;
if(t != u){
swap(b[t], b[u]);
down(t, Size);
}
}
int main()
{
cin >> n;
for(int i = 1; i <= n; i ++) cin >> a[i];
for(int i = 1; i <= n; i ++) cin >> b[i];
int p = 2;
while(p <= n && b[p] >= b[p - 1]) p ++;
int k = p;
while(p <= n && a[p] == b[p]) p ++;
if(p == n + 1){
cout << "Insertion Sort" << endl;
while(k >= 1 && b[k] < b[k - 1]) swap(b[k], b[k - 1]), k --;
}else{
cout << "Heap Sort" << endl;
p = n;
while(b[1] <= b[p]) p --;
swap(b[1], b[p]);
down(1, p - 1);
}
for(int i = 1; i <= n; i ++) {
if(i != 1) cout << " ";
cout << b[i];
}
return 0;
}