#include <iostream>
using namespace std;

#include "Leftist_heap.h"

int main() {
	Data_structures::Leftist_heap<int> heap1;
	Data_structures::Leftist_heap<int> heap2;

	for ( int i = 1; i <= 16; ++i ) {
		int n = (37*i) % 100;
		heap1.push( n );
	}

	for ( int i = 17; i <= 32; ++i ) {
		int n = (37*i) % 100;
		heap2.push( n );
	}

	cout << heap1 << endl;
	cout << heap2 << endl;

	heap1.push( heap2 );

	cout << heap1 << endl;

	for ( int i = 1; i <= 32; ++i ) {
		cout << heap1.pop() << endl;
	}

	cout << "hi" << endl;

	cout << heap1 << endl;
	cout << heap2 << endl;

	return 0;
}