Find top k values, classical heap problems.

Here we need find top 2 values, and pop them from heap, then we will meet two cases:

  1. If they are not same, put back the differ between them, continue.
  2. Otherwise, continue directly.