1. map.cpp

#include<iostream>
#include<map>
using namespace std;
int main()
{
    map<char,int>Map;
    map<char,int>::iterator it;
    for(char c='a';c<='j';c++)
    {
        int value=(int)c;
        Map[c]=value;
    }

    cout<<"Map size: "<<Map.size()<<endl;

    cout<<"Map key value: \n";
    for(it=Map.begin();it!=Map.end();it++)
    {
        cout<<"Key-> "<<(*it).first<<" value-> "<<(*it).second<<endl;
    }
    
    cout<<"Key a value: "<<Map['a']<<endl;

    if(Map.find('a')!=Map.end())cout<<"key 'a' found"<<endl;
    else cout<<"key 'a' not found"<<endl;

    if(Map.find('z')!=Map.end())cout<<"key 'z' found"<<endl;
    else cout<<"key 'z' not found"<<endl;

    Map.clear();

    cout<<"Is map empty: "<<Map.empty()<<endl;

    return 0;
}

2. output

Map size: 10
Map key value: 
Key-> a value-> 97
Key-> b value-> 98
Key-> c value-> 99
Key-> d value-> 100
Key-> e value-> 101
Key-> f value-> 102
Key-> g value-> 103
Key-> h value-> 104
Key-> i value-> 105
Key-> j value-> 106
Key a value: 97
key 'a' found
key 'z' not found
Is map empty: 1