How to find the Entry with largest Value in a C++ Map

Given a map in C++, the task is to find the entry in this map with the highest value.

Examples:

Input: Map = {ABC = 10, DEF = 30, XYZ = 20}
Output: DEF = 30

Input: Map = {1 = 40, 2 = 30, 3 = 60}
Output: 3 = 60

Approach

1. Iterate the map entry by entry with help of iterators

   map::iterator itr;
   for (itr = some_map.begin();
        itr != some_map.end();
        ++itr) 
   {
       // operations
   }
   

2. Store the first entry in a reference variable to compare to initially.
3. If the current entry’s value is greater than the reference entry’s value, then store the current entry as the reference entry.
4. Repeat this process for all the entries in the map.
5. In the end, the reference variable has the required entry with the highest value in the map.
6. Print this entry

Below is the implementation of the above approach:

Map: 1 = 40, 2 = 30, 3 = 60, 
Entry with highest value: 3 = 60