STL之map笔记

#include "stdafx.h"#include <string>#include <iostream>#include <algorithm>#include <vector>#include <list>#include <map>using namespace std;bool gt_42(const pair<const string, int>& r){return r.second>42;}int main(int argc, char* argv[]){ printf("Hello World!/n"); typedef map<string,int> U_map; U_map umap; umap.insert(map<string,int>::value_type("a",11));//下面网址上说这个方法比umap["a"]=1更有效率，节省开销。 umap.insert(map<string,int>::value_type("b",312)); 

 typedef map<string ,int>::const_iterator MI; MI i=find_if(umap.begin(),umap.end(),gt_42);    //iterator是一个pair对象。 cout<<(*i).second<<endl<<(*i).first<<endl;     //(*i)代表map中一个键值对，second取第二个值。 return 0;                                                                          //map的介绍网址                                                                         //http://wenku.baidu.com/view/d59095ea6294dd88d0d26b41.html}