Priority Queue

Problems on priority queues, including always taking the smallest or largest element, merging sorted lists, scheduling tasks by deadline or priority, running medians, the k-th smallest element and simulating events in time order.

The priority queue article in the Data structures section explains the heap behind it, and Dijkstra's algorithm shows its best-known use. Related problem sets are under Greedy algorithms and Data structures.