This note shows a new implicit data structure, called a set of nested s-heaps, for deleting the maximum value of n elements in 2 long n comparisons. Nested s-heaps can be used to improve the efficiency of Smoothsort.