Problem
A. You are asked to implement a priority queue that supports 2 operations: insert an item (you can assume it has an integer key) and delete the item with the maximum key. Describe your data structure and the worst case complexity of each operation.
B. Given a large unsorted array of salaries, give an efficient algorithm and its average case complexity to print the top 50% of the salaries.