I think one way to solve is to build a max heap of the array(in place). Now remove the max element and keep it at the end and reheapify. This algorithm takes O(nlogn). I am not able to think how to make O(nlogk).
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
