Suppose that your application will have a huge number of insert operations, but only a few remove the maximum operations. Which priority-queue implementation do you think would be most effective: heap, unordered array, or ordered array, unordered linked list, ordered linked list?

Assume the number of remove the maximum operations is no more than 15.