Начало
Рабочее место участника
| Выбрать соревнование | Задачи | Послать решение | Результаты проверки | Статистика по задачам | Вопросы и ответы | Результаты соревнования | Состояние сервера | Изменить данные | Управление командой | Помощь |
Задачи
1636. Frequency sorter
СортировкаОлимпиадные задачи на английском языке
| 04/07/2011 | Лето 2011 - дорешивание (11C) |
| 18/07/2011 | Лето 2011 - 11 (C) |
| 09/01/2017 | Марафон 1 (командный) "Hatter's riddles" (H) |
Ограничения: время – 1s/2s, память – 32MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод 
Послать решение Blockly Посылки Темы Где Обсудить (0)
Mirko is a great code breaker. He knows any cipher in the world can be broken by frequency analysis.
He has completely the wrong idea what frequency analysis is, however.
He intercepted an enemy message. The message consists of N numbers, smaller than or equal to C
Mirko belives freqency analysis consists of sorting this sequence so that more frequent numbers appear
before less frequent ones.
Formally, the sequence must be sorted so that given any two numbers `X` and `Y` , `X` appears before `Y` if
the number of times `X` appears in the original sequence is larger than the number of time `Y` does. If the
number of appearances is equal, the number whoes value appears sooner in the input should appear
sooner in the sorted sequence.
Help Mirko by creating a "frequency sorter".
Input
First line of input contains two integers, `N` (`1\ ≤\ N\ ≤\ 1\ 000`), length of message, and
`C` (`1\ ≤\ C\ ≤\ 1\ 000\ 000\ 000`), the number from task description.
Next line contains `N` integers smaller than or equal to `C`, message itself.
Output
First and only line of output should contain `N` numbers, the sorted sequence.
Sample Input 1
5 2 2 1 2 1 2
Sample Output 1
2 2 2 1 1
Sample Input 2
9 3 1 3 3 3 2 2 2 1 1
Sample Output 2
1 1 1 3 3 3 2 2 2
Sample Input 3
9 77 11 33 11 77 54 11 25 25 33
Sample Output 3
11 11 11 33 33 25 25 77 54
