A priority queue (aka, heap) is the data structure of choice when you're going to be doing a lot of inserts at various times, and you only care about the smallest (largest) element in the data...