Problem Brief

Score Points

NEW GRADOA

There is a board with N cells (numbered from 0 to N-1) arranged in a row. The board is described by an array points and a string tokens, both of length N. The K-th cell of the string tokens is either 'T' or 'E', indicating whether the K-th cell contains a token or is empty.

If the K-th cell contains a token, we assign the number of points equal to points[K]. Additionally, we score another for every pair of adjacent tokens. The goal is the total number of points we score?

𓂃 ོ𓂃Big shoutout to Aura Man for all the support! 🐳𓂃 𓈒𓏸

1Example 1

Input

points = [3, 4, 5, 2, 3], tokens = "TEETT"

Output

Explanation

Cells 0, 3 and 4 contain tokens. The sum of points in these cells is 8. Also, there is one pair of adjacent cells with tokens, which result in 1 extra point. The function should return 9.

2Example 2

Input

points = [3, 2, 1, 2, 2], tokens = "ETTTE"

Output

Explanation

Cells 1, 2 and 3 contain tokens. the sum of points in these cells is 5. Also there are two pairs of adjacent cells with tokens, which results in 2 extra points. The function should return 7 :)

3Example 3

Input

points = [2, 2, 2, 2], tokens = "TTTT"

Output

Explanation

All cells contain tokens. The function should return 11 :)

Constraints

Limits and guarantees your solution can rely on.

array points and string tokens are of the same length N;

N is an integer within [1, 100];

each element of array points is an integer within the range [1, 1,000];

string tokens consists only of the characters 'E' and/or 'T'.