D. Easy Problem Educational Codeforces Round 57 (Rated for Div. 2)（线性DP）

D. Easy Problem

题意:给你一个长度为n的字符串，每个字符都有权值，操作是：删去若干个字符，最终结果是要求最终字串中没有"hard"这个子序列，注意是子序列就行，让你输出满足上述条件的所删字符的最小 权值和。qwq

题解:dp[1]表示构不成h的最小代价，dp[2]表示构不成ha的最小代价，dp[3]表示构不成har的最小代价，dp[4]表示构不成hard的最小代价。那么答案就是dp[4]。

代码：

#include <iostream>
#define inf 0x3f3f3f3f
#define Pair pair<int,int>
#define int long long
#define fir first
#define sec second
namespace fastIO{
  #define BUF_SIZE 100000
  #define OUT_SIZE 100000
  //fread->read
  bool IOerror=0;
//inline char nc(){char ch=getchar();if(ch==-1)IOerror=1;return ch;}
  inline char nc(){
    static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;
      if(p1==pend){
        p1=buf;pend=buf+fread(buf,1,BUF_SIZE,stdin);
        if(pend==p1){IOerror=1;return -1;}
      }
      return *p1++;
  }
  inline bool blank(char ch){return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';}
  template<class T> inline bool read(T &x){
    bool sign=0;char ch=nc();x=0;
    for(;blank(ch);ch=nc());
    if(IOerror)return false;
    if(ch=='-')sign=1,ch=nc();
    for(;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';
    if(sign)x=-x;
    return true;
  }
  inline bool read(double &x){
    bool sign=0;char ch=nc();x=0;
    for(;blank(ch);ch=nc());
    if(IOerror)return false;
    if(ch=='-')sign=1,ch=nc();
    for(;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';
    if(ch=='.'){double tmp=1; ch=nc();for(;ch>='0'&&ch<='9';ch=nc())tmp/=10.0,x+=tmp*(ch-'0');}
      if(sign)x=-x;return true;
  }
  inline bool read(char *s){
    char ch=nc();
    for(;blank(ch);ch=nc());
    if(IOerror)return false;
    for(;!blank(ch)&&!IOerror;ch=nc())*s++=ch;
    *s=0;
    return true;
  }
  inline bool read(char &c){
    for(c=nc();blank(c);c=nc());
    if(IOerror){c=-1;return false;}
    return true;
  }
  template<class T,class... U>bool read(T& h,U&... t){return read(h)&&read(t...);}
  #undef OUT_SIZE
  #undef BUF_SIZE
};using namespace fastIO;using namespace std;
const int N=1e5+5;
const int mod=1e9+7;

int n,v[N],dp[5];
char str[N];

signed main(){
  read(n);
  read(str+1);
  for(int i=1;i<=n;i++)read(v[i]);
  
  /* hard */
  for(int i=1;str[i];i++){
    if(str[i]=='h')dp[1]+=v[i];
    if(str[i]=='a')dp[2]=min(dp[1],dp[2]+v[i]);
    if(str[i]=='r')dp[3]=min(dp[2],dp[3]+v[i]);
    if(str[i]=='d')dp[4]=min(dp[3],dp[4]+v[i]);
  }
  printf("%lld\n",dp[4]);
  
  return 0;
}

Vasya is preparing a contest, and now he has written a statement for an easy problem. The statement is a string of length nn consisting of lowercase Latin latters. Vasya thinks that the statement can be considered hard if it contains a subsequence hard; otherwise the statement is easy. For example, hard, hzazrzd, haaaaard can be considered hard statements, while har, hart and drah are easy statements.

Vasya doesn't want the statement to be hard. He may remove some characters from the statement in order to make it easy. But, of course, some parts of the statement can be crucial to understanding. Initially the ambiguity of the statement is 00, and removing ii-th character increases the ambiguity by aiai (the index of each character is considered as it was in the original statement, so, for example, if you delete character r from hard, and then character d, the index of d is still 44 even though you delete it from the string had).

Vasya wants to calculate the minimum ambiguity of the statement, if he removes some characters (possibly zero) so that the statement is easy. Help him to do it!

Recall that subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.

Input

The first line contains one integer nn (1≤n≤1051≤n≤105) — the length of the statement.

The second line contains one string ss of length nn, consisting of lowercase Latin letters — the statement written by Vasya.

The third line contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤9982443531≤ai≤998244353).

Output

Print minimum possible ambiguity of the statement after Vasya deletes some (possibly zero) characters so the resulting statement is easy.

Examples

input

Copy

6
hhardh
3 2 9 11 7 1

output

Copy

5

input

Copy

8
hhzarwde
3 2 6 9 4 8 7 1

output

Copy

4

input

Copy

6
hhaarr
1 2 3 4 5 6

output

Copy

0

Note

In the first example, first two characters are removed so the result is ardh.

In the second example, 55-th character is removed so the result is hhzawde.

In the third example there's no need to remove anything.