uva 12504 Updating a Dictionary

题意：给你两个新老字典集合，然后问你新的相对老的有哪些元素增加，减少，值改变，或者不变！然后把增加的，减少的，改变的分别按照字典序输出！

解法：map！

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        char str[105],str1[105];
        string s,s1,s3[105],s4[105],s5[105];
        map<string,string>pq,qp;
        scanf("%s",str);
        int len=strlen(str);
        for(int i=0;i<len;i++)
        {
            if(isalpha(str[i]))
                s+=str[i];
            else if(isdigit(str[i]))
                s1+=str[i];
            else if(str[i]==','||str[i]=='}')
            {
                pq[s]=s1;
                s.clear();
                s1.clear();
            }
        }
        scanf("%s",str1);
        int len1=strlen(str1);
        int f=0,f1=0,f2=0,k=0,k1=0,k2=0;
        for(int i=0;i<len1;i++)
        {
            if(isalpha(str1[i]))
                s+=str1[i];
            else if(isdigit(str1[i]))
                s1+=str1[i];
            else if(str1[i]==','||str1[i]=='}')
            {
                qp[s]=s1;
                if(!s.empty()&&!pq.count(s))
                {
                    f=1;
                    s3[k++]=s;
                }
                else if(!s.empty()&&pq[s]!=s1)
                {
                    f1=1;
                    s4[k1++]=s;
                }
                s.clear();
                s1.clear();
            }
        }
        for(int i=0;i<len;i++)
        {
            if(isalpha(str[i]))
                s+=str[i];
            else if(isdigit(str[i]))
                s1+=str[i];
            else if(str[i]==','||str[i]=='}')
            {
                if(!s.empty()&&!qp.count(s))
                {
                    f2=1;
                    s5[k2++]=s;
                }
                s.clear();
                s1.clear();
            }
        }
        if(f)
        {
            sort(s3,s3+k);
            cout<<"+"<<s3[0];
            for(int i=1;i<k;i++)
                cout<<","<<s3[i];
            cout<<"\n";
        }
        if(f2)
        {
            sort(s5,s5+k2);
            cout<<"-"<<s5[0];
            for(int i=1;i<k2;i++)
                cout<<","<<s5[i];
            cout<<"\n";
        }
        if(f1)
        {
            sort(s4,s4+k1);
            cout<<"*"<<s4[0];
            for(int i=1;i<k1;i++)
                cout<<","<<s4[i];
            cout<<"\n";
        }
        if(!f&&!f1&&!f2)
            cout<<"No changes\n";
        cout<<"\n";
    }
    return 0;
}