What is the expected running time of the methods for maintaining a maxima set if we insert

Question:

What is the expected running time of the methods for maintaining a maxima set if we insert n pairs such that each pair has lower cost and performance than one before it? What is contained in the sorted map at the end of this series of operations? What if each pair had a lower cost and higher performance than the one before it?

Fantastic news! We've Found the answer you've been seeking!