ransome_note.cpp

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

bool ransom_note(vector<string> magazine, vector<string> ransom) {
	unordered_map <string, int> mag;
    unordered_map <string,int>::iterator it;
    
    
    int i =0;
    for(i=0; i< magazine.size(); i++) {
        string s = magazine[i];
        it = mag.find(s);
        if (it == mag.end()) { /* Not found */
            mag.insert(make_pair(magazine[i],1));
        }
        else { /* 
        Found, i->first is f, i->second is ++-- */ 
        it->second++;
        }
    }
    for(i =0; i< ransom.size();i++){
        if(mag[ransom[i]]==0) return false;
        mag[ransom[i]]--;
    }
    return true;
    
}

int main(){
    int m;
    int n;
    cin >> m >> n;
    vector<string> magazine(m);
    for(int magazine_i = 0;magazine_i < m;magazine_i++){
       cin >> magazine[magazine_i];
    }
    vector<string> ransom(n);
    for(int ransom_i = 0;ransom_i < n;ransom_i++){
       cin >> ransom[ransom_i];
    }
    if(ransom_note(magazine, ransom))
        cout << "Yes\n";
    else
        cout << "No\n";
    return 0;
}