PAT (Advanced Level) 1092. To Buy or Not to Buy (20)

简单题。

#include<cstdio>
#include<cstring>

const int maxn=1e5+;
char s1[maxn],s2[maxn];
int cnt[];
int tot[];

int main()
{
    scanf("%s",s1);
    scanf("%s",s2);

    memset(cnt,,sizeof cnt);
    memset(tot,,sizeof tot);

    for(int i=;s1[i];i++) cnt[s1[i]]++;
    for(int i=;s2[i];i++) tot[s2[i]]++;

    bool flag=;
    int ans=;

    for(int i=;i<;i++)
    {
        if(cnt[i]<tot[i]){
            flag=;
            ans=ans+tot[i]-cnt[i];
        }
    }

    if(flag==) printf("No %d\n",ans);
    else printf("Yes %d\n",strlen(s1)-strlen(s2));
    return ;
}