How do I implement a map in C++11?

How do I implement a map in C++11?

To implement a map in C++11, you can use the std::map class from the Standard Template Library. Here's a basic example:

#include <iostream>
#include <map>

int main() {
    std::map<int, std::string> myMap;
    myMap[1] = "One";
    myMap[2] = "Two";
    myMap[3] = "Three";

    for (const auto& pair : myMap) {
        std::cout << pair.first << " : " << pair.second << std::endl;
    }
    return 0;
}

What are the advantages of using a map over a vector?

Maps provide key-value pair storage, allowing for faster lookups compared to vectors, which require linear search. Additionally, maps maintain order based on keys.

Can I use custom types as keys in a map?

Yes, you can use custom types as keys in a map, but you need to define a comparison operator for your custom type to ensure proper ordering.

What happens if I try to insert duplicate keys?

If you insert a duplicate key, the new value will overwrite the existing value associated with that key in the map.