Heap / Priority Queue problems

Always having fast access to the smallest or largest remaining item.

1. Kth Largest Element in a Stream (Easy)
2. Last Stone Weight (Easy)
3. K Closest Points to Origin (Medium)
4. Kth Largest Element in an Array (Medium)
5. Task Scheduler (Medium)
6. Design Twitter (Medium)
7. Find Median from Data Stream (Hard)