Read from standard input a non-negative integer n, followed by n pairs each consisting of a word (no spaces, letters only) and a non-negative integer representing the frequency of that word. Print the n pairs in decreasing order of frequency. For equal frequencies, use lexicographically increasing order of the words.
Data is read from standard input (in the format described), not from a file.
The first line contains `n`. Each of the following `n` lines contains a word (at most `30` characters) and its frequency, separated by a space. - `1 <= n <= 100` - frequency is between `1` and `1000000` - words are unique and consist of lowercase or uppercase letters
The program prints `n` lines, each containing the word and its frequency separated by a space, in the required order.
4 mar 2 para 5 cais 5 prun 1
cais 5 para 5 mar 2 prun 1
Use the Get Hint button in the action bar to reveal a guided hint.
No comments yet. Be the first to start the discussion!
4 mar 2 para 5 cais 5 prun 1
cais 5 para 5 mar 2 prun 1
Community solutions unlock after you submit a passing solution. Don't peek.
Create a free account to write code, submit solutions, and track your progress.
