2
Contributors
1
Reply
2
Views
6 Years
Discussion Span
Last Post by csurfer
0

Check out the implementations of map and multimap if you want to know about the implementation of hash tables.

But in my view instead of creating a separate hash table why not use the functionality of priority_queue itself which has the largest element always at top? Try to collect the elements of the priority_queue in decreasing order may be in an array over which you can use a binary search.

This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.