Write in pseudocode or explain your

algorithm in words $($the latter is preferred$).$

justify answers.

ALWAYS analyze the running time complexity of algorithms

Question: Give an efficient data structure supporting the following operations. Insert$($S$,$ x$),$

DeleteM ax$($S$),$ and Delete$100$th$($S$),$which deletes the $100$th largest element in the

structure. Assume that the number of elements is more than $100.$ Also, assume that

the numbers are pairwise distinct, so the $100$th largest element is well defined.

$2$