CDOJ 1300 Easy Problem

队友说是大水题

代码：

//Template for ACM

#define LL long long
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFF7FFFFFFF

#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define MAXN (100000+2)

int a[MAXN][26], c[MAXN];
char s[MAXN];

void _cnt(int k) {
	int n = strlen(s);
	for (int i = 0; i < n; ++i) {
		++a[k][s[i] - 'a'];
	}
}

int main(){
	memset(a, 0, sizeof(a));
	int n; scanf("%d", &n);
	for (int i = 0; i < n; ++i) {
		scanf("%s", s);
		_cnt(i);
	}
	for (int i = 0; i < n; ++i) {
		scanf("%d", &c[i]);
	}

	long long ans = 0,tmp;
	for (int i = 0; i < 26; ++i) {
		tmp = 0;
		for (int j = 0; j < n; ++j) {
			tmp += c[j] * a[j][i];
		}
		if (ans < tmp)ans = tmp;
	}

	printf("%lld\n", ans);

	return 0;
}