Priority Queue Processing

Problem Statement

Priority Queue Processing Problem Description Consider that we have few elements to be inserted into the priority queue. Elements inserted into the queue are in the following format (x, y) where x is the element and y is its priority. An element with a high y value indicates high priority. If two elements have the same priority, the element with a smaller x value will get higher priority. K is the number of elements that have to be removed from the queue that has the highest priority. The problem asks to display the elements that are not removed from the queue, ordered from high priority to low priority elements. Read the input from STDIN and print the output to STDOUT. Do not write arbitrary strings while reading the input or while printing, as these contribute to the standard output. Constraints x should be unique. x and y should not be negative. Input Format The first line of input contains N, where N denotes the number of elements. Next N lines of input contain x and y where x is t