TADM2E 4.29
From Algorithm Wiki
If this claim was true one could construct a linear time sorting algorithm by inserting all elements and then extracting all maximum elements again. Since the lower bound of O(n log n) for searching this is not possible.
