UVA_11340_Newspaper

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define LL unsigned long long
using namespace std;

int main() {
   int t,v,k,M;char line[10100];int cst;
   char car;
   scanf("%d",&t);
   while(t--){
    map<char,int> mp;cst=0;
    scanf("%d",&k);getchar();
    for(int i=0;i<k;i++){
        scanf("%c %d",&car,&v);
        mp[car]=v;
        if (i<k-1) getchar();
    }
    scanf("%d",&M);getchar();
    for(int i=0;i<M;i++){
        gets(line);
        int q=strlen(line);
        for(int i=0;i<q;i++){
            if(mp.find(line[i])==mp.end()){
                continue;
            }else{
                cst+=mp[line[i]];
            }
        }
        line[0]='\0';
    }
    printf("%d.%02d$\n",cst/100,cst%100);

   }
    return 0;
}