1949.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1949 on 2005-10-16 at 20:18:07 */ 
#include <cstdio>
#include <cstring>
#define  MAX  1024
#define  MAX_LEN 32

typedef struct {
	char word[MAX_LEN];
	long value;
} HayPoint;

int main()
{
	HayPoint hp[MAX];
	long long total;
	char word[MAX_LEN];
	int m, n;
	int i, j;
	
	while(scanf("%d %d", &m, &n) == 2) {
		for(i = 0; i < m; i++) {
			scanf("%s %ld", &hp[i].word, &hp[i].value);
		}
		for(i = 0; i < n; i++) {
			total = 0;
			while(true) {
				scanf("%s", word);
				if(!strcmp(word, ".")) {
					break;
				} else {
					for(j = 0; j < m; j++) {
						if(!strcmp(word, hp[j].word)) {
							total += hp[j].value;
							break;
						}
					}
				}
			}
			printf("%lld\n", total);
		}
	}
	
	return 0;
}