Submission #43108120

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <assert.h>
#include <queue>

using namespace std;

int main()
{
	int n, m;
	cin >> n >> m;

	vector<string> C;
	vector<string> D;
	map<string, int> P;

	for (int i = 0; i < n; i++)
	{
		string c;
		cin >> c;
		C.push_back(c);
	}

	for (int i = 0; i < m; i++)
	{
		string d;
		cin >> d;
		D.push_back(d);
	}

	int defaultPrice;

	cin >> defaultPrice;

	for (int i = 0; i < m; i++)
	{
		int p;
		cin >> p;
		P[D[i]] = p;
	}

	int sum = 0;
	for (int i = 0; i < n; i++)
	{
		sum += (P.find(C[i]) != P.end()) ? P[C[i]] : defaultPrice;
	}

	cout << sum << endl;

	return 0;
}

Submission Info

Judge Result