-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRansomNote.cpp
More file actions
56 lines (53 loc) · 1.13 KB
/
RansomNote.cpp
File metadata and controls
56 lines (53 loc) · 1.13 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#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;
map<string, int> wordMap;
bool ransom_note(vector<string> magazine, vector<string> ransom) {
int len = ransom.size();
for(int i=0;i<len;i++){
if(!wordMap[ransom[i]]) return false;
else{
wordMap[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];
wordMap[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;
}