class Binheap {
	// Datastructure for binary heap (no. prioritetskø)
	// After Anders Fongen
	// Additional comments by Sten Morten Andersen
private:
	int capacity;
	int size;
	int *elements;
	int isFull()  { return size == capacity; }
	int isEmpty() { return size == 0; }
	void percolateUp(int);
	void percolateDown(int);
public:
	Binheap(int);	// Constructor needs storage capacity
	int deleteMin();
	void insert(int);
	void changeKey(int,int); // Changes priority of element
	void printHeap();
};