#include <iostream>
#include "heaptype.h"
#include "pqtype.h"

int main () {
    PQType<int> p(50);

    if (p.IsEmpty())
        cout << "Queue is empty" << endl;
    else
        cout << "Queue is not empty" << endl;

    int input;
    for (int i = 0; i < 10; i++) {
        cin >> input;
        p.Enqueue(input);
    }

    if (p.IsEmpty())
        cout << "Queue is empty" << endl;
    else
        cout << "Queue is not empty" << endl;

    p.PrintQueue();

    int item;
    p.Dequeue(item);
    cout << item << endl;

    p.Dequeue(item);
    cout << item << endl;

    p.PrintQueue();

    p.Dequeue(item);
    p.Dequeue(item);
    p.Dequeue(item);

    p.PrintQueue();

    PQType<int> p2(50);
    for (int i = 0; i < 10; i++) {
        cin >> input;
        p2.EnqueueMin(input);
    }

    p2.PrintQueue();

    p2.DequeueMin(item);
    cout << item << endl;

    p2.DequeueMin(item);
    cout << item << endl;

    p2.PrintQueue();

    p2.DequeueMin(item);
    p2.DequeueMin(item);
    p2.DequeueMin(item);

    p2.PrintQueue();

    return 0;
}