PAT甲级1092题（买珠子）

1.题目介绍

bead：珠子

2.考察点，难度

散列类，Map容器插入方法，Map容器遍历方法，难度易

3.解题代码

#include <iostream>
#include <map>
using namespace std;

int main(){
    string a,b;
    getline(cin,a);
    getline(cin,b);

    int sum=0,flag=1;
    map<char,int> store,need;
    map<char,int>::iterator iter;
    for(int i=0;i<a.length();i++){
        if(store.find(a[i])==store.end()){
            store.insert(pair<char,int>(a[i],1));
        }
        else{
            store[a[i]]+=1;
        }
    }

    for(int i=0;i<b.length();i++){
        if(need.find(b[i])==need.end()){
            need.insert(pair<char,int>(b[i],1));
        }
        else{
            need[b[i]]+=1;
        }
    }

    for(iter=need.begin();iter!=need.end();iter++){
        if(iter->second>store[iter->first]){
            sum += iter->second - store[iter->first];
            flag=0;
        }
    }
    flag?cout<<"Yes "<<a.length()-b.length()<<endl:cout<<"No "<<sum<<endl;

    return 0;
}

4.原题地址

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