#include <iostream>#include<map>using namespacestd;intMain () {
Method One: Map<int,int>m; Srand ((unsigned) time (NULL)); for(inti =0; i< -; i++) { intKey = rand ()% -+1;//random number of 1~100 intValue = rand ()%2;//0 or 1 random numbersprintf"%d times before insertion: key=%d, value=%d\n", i+1, Key,value); M.insert (Pair<int,int>(Key,value)); } printf ("\ n"); Map<int,int>:: Iterator iter; for(iter = M.begin (); ITER! = M.end (); iter++) {printf ("key:%d, value:%d\n",iter->first,iter->second); } printf ("\ n"); return 0;}
Auto Sort:
Method Two (26 English letters):
#include <iostream>#include<map>using namespacestd;intMain () {map<int,int>MC; Srand ((unsigned) time (NULL)); for(CharC='Z'; C >='a'; c--) { intnum = rand ()%2; printf ("%c,%d\n", C,num); Mc.insert (Pair<Char,int>(C,num)); } printf ("\ n"); Map<Char,int>:: Iterator iter; for(iter = Mc.begin (); Iter!=mc.end (); iter++) {printf ("key=%c, value=%d\n",iter->first,iter->second); } printf ("\ n"); return 0;}
Traverse Map:
C + + STL Map auto-sorting feature