title: Finding k smallest elements in a minimum heap
body: <p>Suppose I have a minimum heap of size n.
  I want to find smallest k elements without changing the original min-heap.
  Run-time should be theta(k^2).
  I can use memory theta(k).</p>
  
  <p>How can I do it?</p>