Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

Bangladesh Premier League (BPL) is one the most prestigious cricket tournaments. Talented players from different countries gather here to show off their talents, share knowledge.
But BPL committee is facing some difficulties in selecting teams, making budgets etc. They spend a few crores in buying softwares. But for a specific job, they need your help.
There are **N** teams (**0< N <= 50000)**.
Each team primarily selects up-to **M** players **(15 <= M <= 2000)**.

The lists of primarily-selected players consist of English alphabets of small letters **(‘a’ to ‘z’)**.
Each letter means the cost for a player. Where ‘a’ is the lowest and ‘z’ is the highest. Where value of ‘a’ is 1, value of ‘b’ is 2 … value of ‘z’ is 26.

There is no way to select players of the lowest prices randomly. All players are standing in a circular shape. You have to select a part from that which will be the lexicographically smallest, consisting 15 players for each team. The final cost for a team is sum of the values of all 15 players. Getting a list of players whose value is lexicographically smallest, is the number 1 goal of franchises.

You are given N teams, find out how much money in total is going to be spent to buy teams.

First line of the input will be **N(Number of Teams)** then N lines follow. Each line contains the primarily selected players.

Output the total cost of all the franchises.

Input | Output |
---|---|

5 abegfdsefghdhscdaaabcb skdjsjxxabcaaaabddd gdfgfssllopsjaasddw dsdfsfjdsnfdsaaaxcdaa lpdiryrbsjsgsjabnaaaa | 584 |

59% Solution Ratio

MIST_LastTryEarliest,

SIR.24Fastest, 0.1s

MIST_LastTryLightest, 131 kB

dynamicoviShortest, 662B

Login to submit