Matcom Online Grader
G - Farmer John and the Encryption System
Languages: C++, Java, Python, Kotlin
Time & Memory limits: (details)
<p style='text-align: justify;'>FJ created a new encryption system to protect the information of his cows. In the initial stage, he wants to develop the first requirement of the encryption system with the help of his cows. The first requirement is an algorithm that lexicographically sorts a string of ($1 \leq S \leq 100000$) lowercase letters of the English alphabet. Pretty simple, isn'it? But then FJ was thinking and he realized that it is too simple to break for cows knowing a little of hacking and cybersecurity.That's why he decided to change a little bit the first requirement by combining the usual lexicographical order with information about the frequency of the letters. Therefore, FJ weighted the frequency of each letter more than the usual lexicographical order. Just in case of tie in the frequency of two letters, the lexicographical order will be used to break ties. Summing up, the letters having higher frequency will appear first and in a case of ties, the letters will be sorted in ascending lexicographical order.With this new idea, FJ completed his new encryption system. He asked your help to create a reference program to validate the programs produced by his cows.</p>
FJ created a new encryption system to protect the information of his cows. In the initial stage, he wants to develop the first requirement of the encryption system with the help of his cows.
The first requirement is an algorithm that lexicographically sorts a string of ($1 \leq S \leq 100000$) lowercase letters of the English alphabet. Pretty simple, isn'it? But then FJ was thinking and he realized that it is too simple to break for cows knowing a little of hacking and cybersecurity.
That's why he decided to change a little bit the first requirement by combining the usual lexicographical order with information about the frequency of the letters. Therefore, FJ weighted the frequency of each letter more than the usual lexicographical order. Just in case of tie in the frequency of two letters, the lexicographical order will be used to break ties. Summing up, the letters having higher frequency will appear first and in a case of ties, the letters will be sorted in ascending lexicographical order.
With this new idea, FJ completed his new encryption system. He asked your help to create a reference program to validate the programs produced by his cows.
Input
<p style='text-align: justify;'>The first line contains an integer $S$, representing the length of the string to be encrypted with the new system. The second line contains the string to be encrypted. The string consists only of English lowercase letters ('a'..'z').</p>
The first line contains an integer $S$, representing the length of the string to be encrypted with the new system. The second line contains the string to be encrypted. The string consists only of English lowercase letters ('a'..'z').
Output
The output contains the answer produced by the new system after encrypting the string given in the input.The output contains the answer produced by the new system after encrypting the string given in the input.