1098. Insertion or Heap Sort.cpp

#include <bits/stdc++.h>
using namespace std;
using gg = long long;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    gg ni;
    cin >> ni;
    vector<gg> v1(ni), v2(ni);
    for (gg& i : v1) {
        cin >> i;
    }
    for (gg& i : v2) {
        cin >> i;
    }
    vector<vector<gg>> inserts, heaps;  //存储排序的每趟结果
    vector<gg> v = v1;
    for (gg i = 2; i <= ni; ++i) {  //插入排序
        sort(v.begin(), v.begin() + i);
        inserts.push_back(v);
    }
    v = v1;
    make_heap(v.begin(), v.end());
    for (gg i = 0; i < ni; ++i) {  //堆排序
        pop_heap(v.begin(), v.begin() + ni - i);
        heaps.push_back(v);
    }
    for (gg i = 0; i < inserts.size(); ++i) {  //确认是否是插入排序
        if (inserts[i] == v2) {
            cout << "Insertion Sort\n";
            for (gg j = 0; j < ni; ++j) {
                cout << inserts[i + 1][j] << (j == ni - 1 ? "\n" : " ");
            }
            break;
        }
    }
    for (gg i = 0; i < heaps.size(); ++i) {  //确认是否是堆排序
        if (heaps[i] == v2) {
            cout << "Heap Sort\n";
            for (gg j = 0; j < ni; ++j) {
                cout << heaps[i + 1][j] << (j == ni - 1 ? "\n" : " ");
            }
            break;
        }
    }
    return 0;
}