choose n largest elements in two vector
<p>I have two vectors, each contains n unsorted elements, how can I get n largest elements in these two vectors?</p>

<p>my solution is merge two vector into one with 2n elements, and then use <code>std::nth_element</code> algorithm, but I found that's not quite efficient, so anyone has more efficient solution. Really appreciate.</p>
