Prac7_MaxHeap.cpp

// Implement heap data structure using linked list structure. 
// The list should retrieve high priority object every time the extract operation is performed.

#include "MaxHeap.h"
#include <iostream>

int main(){
    using namespace std;

    MaxHeap data("Ajino Motado");

    data.AddData("data.csv", 1);
    data.PrettyPrinting();

    for (int i = 0; i < 5; i++)
    {
        pair<int, int> k = data.ExtractMax();
        cout << k.first << " " << k.second << endl;
    }
    data.PrettyPrinting();

    for (int i = 0; i < 10; i++)
    {
        data.insert(i, i*10);
    }
    data.PrettyPrinting();
    
    return 0;
}