Sort the hashes 2#11605
Set of words is given. Sort them in ascending order of hashes.
The hash of the string is the sum of the ASCII codes of the characters in it. For example, \mathrm{hash}(\text{"Cat"}) = 67 + 97 + 116 = 280, \mathrm{hash}(\text{"dOG"}) = 100 + 79 + 71 = 250.
Let a string be less than a string if \mathrm{hash}(a) < \mathrm{hash}(b). For example, \mathrm{hash}(\text{"dOG"}) < \mathrm{hash}(\text{"Cat"}) since 250 < 280.
However, there is a special word ADAUniversity in the text, that should always be at the start of the sorted list. We assume that \mathrm{hash}(\text{"ADAUniversity"}) = 0.
For words that have the same hash, sort the words in their lexicographical order.
The text contains a set of words. Each word consists of letters of Latin alphabet (lower and upper case). Only spaces can be present between the words. The number of words in the text does not exceed . The length of each word does not exceed characters.
Print all words sorted according to the given condition. Each word should be printed on a separate line.
Example 1