Codeforces Round #FF (Div. 2)B. DZY Loves Strings

最新推荐文章于 2019-01-03 16:49:00 发布

原创最新推荐文章于 2019-01-03 16:49:00 发布 · 625 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#codeforces #Codeforces Round #FF

贪心专栏收录该内容

1 篇文章

订阅专栏

DZY loves collecting special strings which only contain lowercase letters. For each lowercase letterc DZY knows its valuew_c. For each special strings = s₁s₂...s_|s| (|s| is the length of the string) he represents its value with a functionf(s), where

$\text{[math]}$

Now DZY has a string s. He wants to insertk lowercase letters into this string in order to get the largest possible value of the resulting string. Can you help him calculate the largest possible value he could get?

Input

The first line contains a single string s (1 ≤ |s| ≤ 10³).

The second line contains a single integer k (0 ≤ k ≤ 10³).

The third line contains twenty-six integers from w_a tow_z. Each such number is non-negative and doesn't exceed1000.

Output

Print a single integer — the largest possible value of the resulting string DZY could get.

Sample test(s)

Input

abc
3
1 2 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

Output

Note

In the test sample DZY can obtain "abcbbc",value = 1·1 + 2·2 + 3·2 + 4·2 + 5·2 + 6·2 = 41.

贪心题，取自母中最大值放在最后

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
const int maxn=1000+10;
char s[maxn];
int aa[26];
int b[maxn];
map<char,int>mm;
vector<int>q;
int main()
{
	int k;
	while(cin>>s)
	{
		int maxa=-1;
		int len=strlen(s);
		scanf("%d",&k);


		for(int i=0;i<26;i++)
		{
			cin>>aa[i];
			maxa=max(maxa,aa[i]);
			mm['a'+i]=aa[i];
		}
		for(int i=0;i<len;i++)
		{
			b[i]=mm[s[i]];
			q.push_back(b[i]);
		}
		int ans=0;
		int c=lower_bound(b,b+len,maxa)-b;
		for(int i=0;i<len;i++)
		{
			ans+=mm[s[i]]*(i+1);
		}
		for(int i=len;i<len+k;i++)
		{
			ans+=maxa*(i+1);
		}
		cout<<ans<<endl;
	}
	return 0;
}