I need help generating solid pseudocode for this algorithm I'm creating. It runs in O(n + klogk).

I need to get the k largest elements in an array of size n.

We will have 2 max heaps, and 1 array of size k. The 1st max heap is built like normal from the array. O(n). The 2nd max heap holds the original root from the first max heap initially.

Algorithm:

1. Remove the root from the 2nd max heap and place the value from that node in the array.

2. Add the two children nodes from the 1st max heap to the 2nd max heap.

3. Repeat to step 1.

This should be O(n + klogk) unless I'm mistaken. I'm having a hard time getting this into pseudocode though. Any help? Thanks!