#include <iostream>
using namespace std;

class MinMaxPQ {

private:
	// your fields go here
public:
	MinMaxPQ();
	~MinMaxPQ();

	int size();
	void insert(int p);
	int deleteMin();
	int deleteMax();
 	int priorityAt(int i);
};

MinMaxPQ::MinMaxPQ() {
// post: constructs an empty min-max PQ
}

MinMaxPQ::~MinMaxPQ() {
// post: destructs the min-max PQ
}

int MinMaxPQ::size() {
// post: returns the number of elements in the PQ,
	return 0;
}

void MinMaxPQ::insert(int k) {
// post: element with key k has been added to the min-max PQ.  
}	

int MinMaxPQ::deleteMin() {
// pre: the PQ is non-empty
// post: deletes and returns the minimum key in O(log n) time
	return 0;
}

int MinMaxPQ::deleteMax() {
// pre: the PQ is non-empty
// post: deletes and returns the maximum key in O(log n) time
	return 0;
}

int MinMaxPQ::priorityAt(int i) {
// pre: 0 <= i < size of MinMaxPQ
// post: returns the key of the item that would be at A[i] in array-representation of the PQ
}


// Please leave the following "#ifndef" lines in place; this is needed
// for the cs240 scripts to run correctly.

#ifndef TESTING
int main() {
	// your testing routines go here
}
#endif