CFR 461 DIV2-D. Robot Vacuum Cleaner

D. Robot Vacuum Cleaner

time limit per test 1 second 
memory limit per test 256 megabytes

Problem Description

Pushok the dog has been chasing Imp for a few hours already. 
 
Fortunately, Imp knows that Pushok is afraid of a robot vacuum cleaner.

While moving, the robot generates a string t consisting of letters ‘s’ and ‘h’, that produces a lot of noise. We define noise of string t as the number of occurrences of string “sh” as a subsequence in it, in other words, the number of such pairs (i, j), that i < j and and .

The robot is off at the moment. Imp knows that it has a sequence of strings ti in its memory, and he can arbitrary change their order. When the robot is started, it generates the string t as a concatenation of these strings in the given order. The noise of the resulting string equals the noise of this concatenation.

Help Imp to find the maximum noise he can achieve by changing the order of the strings.

Input

The first line contains a single integer n (1 ≤ n ≤ 1e5) — the number of strings in robot’s memory.

Next n lines contain the strings t1, t2, …, tn, one per line. It is guaranteed that the strings are non-empty, contain only English letters ‘s’ and ‘h’ and their total length does not exceed 1e5.

Output

Print a single integer — the maxumum possible noise Imp can achieve by changing the order of the strings.

Examples

Input 
4 
ssh 
hs 
s 
hhhs 
Output 
18

Input 
2 
h 
s 
Output 
1

Note

The optimal concatenation in the first sample is ssshhshhhs.

题意：

        将所有的字符串拼成一个，要求子序列中sh出现最多次，输出出现的次数。

解题心得：

            刚看到题目把它当dp做了,推了很久没推出来,后来发现是个贪心,s占的大的字符串应该放在前面,因为s和后面的h也可以组成sh

代码:

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+100;
const long long Max = 1e11;
struct String{
    double p;
    int num_s,num_h,temp;
    friend bool operator < (const String a,const String b) {//按照s和h的比例从大到小排序
        return a.p > b.p;
    }
}st[maxn];

int n;

void init(){
    char s[maxn];
    for(int i=0;i<n;i++){
        scanf("%s",s);
        int len = strlen(s);
        int num_s,num_h,temp;
        num_s = num_h = temp = 0;
        for(int j=0;j<len;j++){
            if(s[j] == 's')
                num_s++;
            else{
                temp += num_s;//字串自身能形成多少个sh
                num_h++;
            }
        }
        double p;
        if(num_h == 0)//分母是0直接赋予最大值
            p = Max;
        else
            p = (double)num_s/(double)num_h;
        st[i].num_s = num_s;
        st[i].num_h = num_h;
        st[i].temp = temp;
        st[i].p = p;
    }
    sort(st,st+n);
}

long long get_ans(){
    long long ans = 0,num_s = 0;
    for(int i=0;i<n;i++){
        ans += st[i].temp;//自身出现的sh数目
        ans += num_s*st[i].num_h;//当前串和前面已经拼接好的串形成的sh数目
        num_s += st[i].num_s;
    }
    return ans;
}

int main(){
    scanf("%d",&n);
    init();
    long long ans = get_ans();
    printf("%lld\n",ans);
    return 0;
}