merge two priority queues

Question

std::priority_queue<some_type, std::vector<some_type>, some_comparator> A;
std::priority_queue<some_type, std::vector<some_type>, some_comparator> B;

How can I merge these priority queues A and B based on same comparator. I tried to find builtin function but could not find any.

@BoBTFish I have already thought of it but the problem is its iterator is not accessible. I cannot do A.begin() or A.end(). That interface is not available. — Utkrist Adhikari, Jul 19 '13 at 12:01

score 6 · Accepted Answer · answered Jul 19 '13 at 12:07

6

The simplest way is to simply move objects from one queue to another:

while(!B.empty()) {
    A.push(B.top());
    B.pop();
}

There might exist a more efficient method, though.

answered Jul 19 '13 at 12:07

zch

1 Answers1