Priority Queue

Class Kata „Priority Queue“

Write a class that implements a queue that holds a priority for each element. Elements with a high priority are placed in front of elements with a lower priority. Elements with the same priority are ordered in the order they where inserted into the queue.

The interface of the class has to look like the following:

class PriorityQueue {
	void Enqueue(T element, int priority) {...}
	T Dequeue() {...}
	int Count() {...} // Number of elements in the Queue
}

Example: