Question: Which STL class is the best fit for implementing a collection of data that is always ordered so that the pop operation always gets the greatest of the elements? Suppose you are interested only in push and pop operations.
- `std::list`
- `std::vector`
- `std::priority_queue`
- `std::map`
Answer: The correct answer of the above question is Option C:`std::priority_queue`