How does the std::map work in C++11?

Can you explain how std::map works in C++11?

Sure! std::map is an associative container that stores elements in key-value pairs, where each key is unique.

What are the advantages of using std::map over other containers?

std::map provides fast retrieval of values based on keys, and it maintains the order of elements based on the keys.

How do I insert elements into a std::map?

You can insert elements using the insert() function or the subscript operator. For example: myMap[key] = value;.

Can you show me a simple code example?

Certainly! Here's a quick example:

#include <iostream>
#include <map>

int main() {
    std::map<int, std::string> myMap;
    myMap[1] = "One";
    myMap[2] = "Two";
    for (const auto& pair : myMap) {
        std::cout << pair.first << " : " << pair.second << std::endl;
    }
    return 0;
}