Answer Happy

implementation of enqueue( P pr, T e); method
// Return the length of the queue int length(); // Enqueue a new element. The queue keeps the k elements with the highest priority. void enqueue (P pr, Te); // Serve the element with the highest priority. In case of a tie apply FIFO. Pair<P, T> serve();