POJ 2403

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

map<string,int> coll;

int main()
{
    //freopen("acm.acm","r",stdin);
    int num;
    int test;
    int i;
    string s;
    int cost;
    cin>>num;
    cin>>test;
    map<string,int>::iterator pos;
    for(i = 0; i < num; ++ i)
    {
        cin>>s>>cost;
        //coll[s] = cost;
        coll.insert(pair<string,int>(s,cost));
    }
    int sum;
    for(i = 0; i < test; ++ i)
    {
        sum = 0;
        while(cin>>s)
        {
        //    cout<<sum<<endl;
            if(s == ".")
                break;
            else 
            {    
                pos = coll.find(s);
                if(pos != coll.end())
                {
                    sum += pos->second;
                //    cout<<"___________"<<pos->second<<endl;
                }
            }
        }
        //coll.clear();
        cout<<sum<<endl;

    }
}