Submission #43101415

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

void solve()
{
	ll n,m;
	cin>>n>>m;
	vector<string>colorEatern(n);
	for(int i=0;i<n;++i)
	{
		cin>>colorEatern[i];
	}
	vector<string>color(m);
	vector<int>prices(m+1);
	for(int i=0;i<m;++i)
	{
		cin>>color[i];
	}
	for(int i=0;i<m+1;++i)
	{
		cin>>prices[i];
	}
	unordered_map<string,int>mymap;
	for(int i=0;i<m;++i)
	{
		mymap[color[i]] = prices[i+1];
	}
	ll cost = 0;
	for(int i=0;i<n;++i)
	{
		if(mymap.find(colorEatern[i])!=mymap.end())
		{
			cost+=mymap[colorEatern[i]];
		}
		else
		{
			cost+=prices[0];
		}
	}
	cout<<cost<<'\n';
}

void FastIO()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
}

int main()
{
	FastIO();
	solve();
	return 0;
}

Submission Info

Judge Result