1039. 到底买不买 (20) || 1092. To Buy or Not to Buy (20):map巧用

还有一个月就PAT乙级了,现在开始复习做过的题不深刻还是没思路···感觉乙级要被虐

#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<map>
#include<string>
using namespace std;

int main()
{
        string S1, S2;
        map<char,int>M1, M2;
        cin>>S1>>S2;
        for(int i=0; i<S1.size(); i++)
            M1[S1[i]]++;
        for(int i=0; i<S2.size(); i++)
            M2[S2[i]]++;
        int lack=0;
        for(map<char,int>::iterator it=M2.begin(); it!=M2.end(); it++)
            if(it->second>M1[it->first])
                lack+=it->second-M1[it->first];
        if(lack)
            cout<<"No "<<lack<<endl;
        else
            cout<<"Yes "<<S1.size()-S2.size()<<endl;
        return 0;
}