C++ heap sort

heap_sort.cpp

#include <algorithm>
#include <iostream>

using namespace std;

#define ARR_LEN(arr) (sizeof(arr) / sizeof(arr[0]))

struct element {
    int id;
    int score;
};

struct comp {
    bool operator()(const element& left, const element& right) const {
        return left.score < right.score;
    }
};

int main() {
    element arr[] = {{1, 1}, {2, 10}, {3, 2}, {4, 5}, {5, 7}, {6, 8}, {7, 6}, {8, 4}, {9, 9}, {10, 3}};
    for (int i = 0; i < ARR_LEN(arr); ++i) {
        cout << "id: " << arr[i].id << ", score: " << arr[i].score << " | ";
    }
    cout << endl;

    comp c;
    make_heap(arr, arr + ARR_LEN(arr), c);
    for (int i = 0; i < ARR_LEN(arr); ++i) {
        cout << "id: " << arr[i].id << ", score: " << arr[i].score << " | ";
    }
    cout << endl;
    
    sort_heap(arr, arr + ARR_LEN(arr), c);
    for (int i = 0; i < ARR_LEN(arr); ++i) {
        cout << "id: " << arr[i].id << ", score: " << arr[i].score << " | ";
    }
    cout << endl;
    
    return 0;
}