How can I sort a std::map first by value, then by key?

Question

I need to sort a std::map by value, then by key. The map contains data like the following:

  1  realistically
  8         really
  4         rea         


        

Answer 1

You can use std::set instead of std::map.

You can store both key and value in std::pair and the type of container will look like this:

std::set< std::pair > items;

std::set will sort it's values both by original keys and values that were stored in std::map.