1092 To Buy or Not to Buy (20 分)【难度: 简单 / 知识点: 模拟】

https://pintia.cn/problem-sets/994805342720868352/problems/994805374509498368

#include<bits/stdc++.h>
using namespace std;
unordered_map<char,int>mp;
string a,b;
int sum1,sum2,flag=1;
int main(void)
{
    
    
    cin>>a>>b;
    sum1=a.size();
    for(int i=0;i<a.size();i++) mp[a[i]]++;
    for(int i=0;i<b.size();i++)
    {
    
    
        if(mp[b[i]]==0) flag=false,sum2++;
        else mp[b[i]]--,sum1--;
    }
    if(flag) cout<<"Yes "<<sum1<<endl;
    else cout<<"No "<<sum2;
    return 0;
}