STL之map篇

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
#include<iterator>
using namespace std;
bool compare(char c1,char c2)
{
    return c1 <= c2;
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        map<string,int> msi;
        for(int i=0;i<n;++i)
        {
            char temp[45];
            scanf("%s",temp);
            sort(temp,temp+strlen(temp),compare);
            string str(temp);
            //使用find来判断map中是否含有该key
            map<string,int>::iterator it = msi.find(str);
            if(it==msi.end())
            {
                //使用pair来判断是否插入成功
                pair<map<string,int>::iterator,bool> res = msi.insert(pair<string,int>(str,0));
                if(res.second==true)
                {
                    cout<<"OK"<<endl;
                }
                else
                {
                    cout<<"FALSE"<<endl;
                }
            }
            else
            {
                msi[str]++;
            }
            printf("%d\n",msi[str]);
        }

    }
    return 0;
}