Print the biggest K elements in a given heap in O(K*log(K))?

Question

Given the following problem , I\'m not completely sure with my current solution :

Question :

Given a maximum heap with n ele

Answer 1

Indeed, it is too easy, extracting the max element is O(log(N)) where N is the size of the heap. and N≠K.

I will add that searching for a random element is O(N) and not O(Log(N)), but in this case we want to extract the max.