Print the biggest K elements in a given heap in O(K*log(K))?
Given the following problem , I'm not completely sure with my current solution  : 

**Question :** 

Given a heap , is it possible to print all the biggest `K` elements in `O(K*log(K))` ? 

**My answer** :

Yes , it is , since searching an element requires `O(log(K))` , hence doing that 

for `K` elements would take  `O(K * log(K))` running time . 

But it looks too easy ,and I thing that somewhere along the way I forgot something ...

Any ideas would be much appreciated . 

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

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

**Question :** 

Given a heap , is it possible to print all the biggest `K` elements in `O(K*log(K))` ? 

**My answer** :

Yes , it is , since searching an element requires `O(log(K))` , hence doing that 

for `K` elements would take  `O(K * log(K))` running time . 

But it looks too easy ,and I thing that somewhere along the way I forgot something ...

Any ideas would be much appreciated . 

Thanks  