1. map<int,int> ma;
    2. ma.insert(pair<int,int>(0,0));
    3. ma[1] = 1;
    4. cout<<ma.begin()->first<<' '<<ma.begin()->second<<endl;//0 0
    5. cout<<ma.rbegin()->first<<' '<<ma.rbegin()->second<<endl;//1 1
    6. cout<<ma[1]<<endl;// 1
    7. ma[2]=2;
    8. ma.erase(2);
    9. cout<<(int)(ma.find(2) == ma.end())<<endl;// 1