map <int,string> test1,test2;//
    map <int,string>::iterator it1,it2;//迭代器multimap <int,string> test3;multimap <int,string>::iterator it3;

　　 test1.insert(pair<int,string>(1,"song"));test1.insert(pair<int,string>(2,"zhang"));test1.insert(pair<int,string>(3,"wang"));

　　 test1.insert(map<int,string>::value_type(4,"qian"));test1.insert(map<int,string>::value_type(5,"sun"));

    test1[6] = "mao";test1[7] = "guang";

//测试是否插入成功pair<map<int,string>::iterator,bool> insert_Pair;insert_Pair = test1.insert(pair<int,string>(1,"Replace"));if (insert_Pair.second == true){cout<<"insert successfully"<<endl;}else{cout<<"insert failure"<<endl;}

    for (it1 = test1.begin();it1 != test1.end();it1++){cout<<it1->first<<"-----" << it1->second<<endl;}

　　cout<<"反向迭代器"<<endl;//rbegin()指向最后一个元素，rend()指向第一个元素前面，这里++是指往前走一个位置map<int,string>::reverse_iterator reverseIte;for (reverseIte = test1.rbegin();reverseIte != test1.rend();reverseIte++){cout<<reverseIte->first<<"-----" << reverseIte->second<<endl;}

　　//使用数组方式进行遍历for (int i = 1;i <= test1.size();i++){cout<<i<<"-----"<<test1[i]<<endl;}

    //count，判断int i=1;for (it1 = test1.begin();it1 != test1.end();i++,it1++){cout<<i;if (test1.count(i)>0)//元素存在
        {cout<<"is a element of map"<<endl;}else{cout<<"is not a element of map"<<endl;}}

　　it2 = test1.find(6);//查找if (it2 != test1.end()){cout<<"find it:"<<it2->first<<"---"<<it2->second<<endl;}else{cout<<"not find it"<<endl;}

    //删除元素it2  = test1.find(2);test1.erase(it2);