Answer will be max heap of size n.
We can access first max element from max heap in O(1).
After that just delete k max element from heap and after every delete heapify the tree make sure it is max heap, which will take O(logn).
So for K element time complexity will be O(klogn). And K is constant so O(logn).