#include <iostream>
#include <vector>
using namespace std;

// دالة لطباعة الـ array
void printArray(const vector<int>& arr) {
    for (int x : arr) cout << x << " ";
    cout << endl;
}

// heapify (Max Heap)
void heapify(vector<int>& arr, int n, int i) {
    int largest = i;
    int left = 2 * i + 1;
    int right = 2 * i + 2;

    if (left < n && arr[left] > arr[largest])
        largest = left;

    if (right < n && arr[right] > arr[largest])
        largest = right;

    if (largest != i) {
        swap(arr[i], arr[largest]);

        cout << "After swap at index " << i << ": ";
        printArray(arr);

        heapify(arr, n, largest);
    }
}

// build heap مع تتبع التغييرات
void buildHeap(vector<int>& arr) {
    int n = arr.size();

    for (int i = n / 2 - 1; i >= 0; i--) {
        cout << "\nHeapify at index " << i << ":\n";
        heapify(arr, n, i);

        cout << "Array after heapify(" << i << "): ";
        printArray(arr);
    }
}

int main() {
    vector<int> arr = {4, 2,8,5,7,1,10,6,3,4};

    cout << "Original array:\n";
    printArray(arr);

    buildHeap(arr);

    cout << "\nFinal Max Heap:\n";
    printArray(arr);

    return 0;
}