DS inner row heap sort

Title Description

Given a set of data , Use heap sort to sort the data in descending order .（ Build a small top pile ).

Input

The number of data n,n Integer data

Output

Initially created small top heap sequence

Exchange per trip 、 Filtered data sequence , See the example for the output format

   The sample input

8 34 23 677 2 1 453 3 7

Sample output

8 1 2 3 7 23 453 677 34
8 2 7 3 34 23 453 677 1
8 3 7 453 34 23 677 2 1
8 7 23 453 34 677 3 2 1
8 23 34 453 677 7 3 2 1
8 34 677 453 23 7 3 2 1
8 453 677 34 23 7 3 2 1
8 677 453 34 23 7 3 2 1

Code

#include "bits/stdc++.h"
using namespace std;
const int maxn=1e5+20;
int n,a[maxn];

void display(){
    cout<<n;
    for(int i=0;i<n;i++){
        cout<<" "<<a[i];
    }
    cout<<endl;
}

void chang(int id,int n){
    int l=id*2+1,r=id*2+2;
    if(l<n){
        if(r<n){
            if(a[l]<a[r]){
                if(a[l]<a[id]){
                    swap(a[l],a[id]);
                    chang(l,n);
                }
            }
            else if(a[r]<a[id]){
                swap(a[r],a[id]);
                chang(r,n);
            }
        }
        else{
            if(a[l]<a[id]){
                swap(a[l],a[id]);
                chang(l,n);
            }
        }
    }
}

int main(){
//    freopen("123.in","r",stdin);
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    for(int i=n/2;i>=0;i--){
        chang(i,n);
    }
    display();
    for(int i=n-1;i>0;i--){
        swap(a[0],a[i]);
        chang(0,i);
        display();
    }
    return 0;
}