【PAT 甲级简单哈希】1092 To Buy or Not to Buy (20 分)

最新推荐文章于 2023-06-07 14:07:31 发布

KonoHT

最新推荐文章于 2023-06-07 14:07:31 发布

阅读量130

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/MYMarcoreus/article/details/114415798

版权

PAT 专栏收录该内容

87 篇文章 0 订阅

订阅专栏

#include<bits/stdc++.h>
using namespace std;

map<char, int> Cnt;

int main() {
    string origin, target;
    cin >> origin >> target;
    for(char ch: origin)
        Cnt[ch]++;
    for(char ch: target)
        Cnt[ch]--;

    int need = 0;
    bool enough = true;
    for(auto p: Cnt) {
        if(p.second < 0) {
            enough = false;
            need += -p.second;
        }
    }

    if(enough)
        cout << "Yes " << origin.size() - target.size() << endl;
    else
        cout << "No " << need << endl;

    return 0;
}