RKS  RK Sorting
RK is a great code breaker. He knows any cipher in the world can be broken by frequency analysis. He intercepted an enemy message. The message consists of N numbers, smaller than or equal to C. RK 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 RK by creating a "frequency sorter".
Input
First line of input contains two integers, N (1 <= N <= 1000), length of message, and C (1 <= C <= 10^9), 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 9 3 1 3 3 3 2 2 2 1 1 Output 1 1 1 3 3 3 2 2 2
Input 5 2 2 1 2 1 2 Output 2 2 2 1 1
hide comments
beginner:
20190212 19:08:51
Nice problem statement ( adding c in problem :p ) 

mynk322:
20181003 23:17:11
USE ARRAY, VECTOR, AND BRUTE FORCE!!!


sagar_zhcet:
20170619 21:21:57
STL at its peak :) 

vengatesh15:
20170205 05:58:55
easy one AC in 1 go:) 

adichd123:
20160720 18:46:40
Maps+Sort thats it!! 

deadbrain:
20160618 11:52:25
Cakewalk for those familiar with STL. Try doing it in C. Learnt structure sorting using qsort. 

arun_1997:
20160610 10:07:26
really good question of stl..


Siddharth Singh:
20160326 09:30:46
It Was A Hell Of A Question <3 

PRIYANSHU SAINI:
20150825 12:58:11
excellent use of stl... AC in one go


Amit Ajaat:
20150607 11:12:02
Don't dare to do with C languageITS totally a question to introduce you to map standard templates.....in C merge sort on structures may work.......something is going wrong in testcase 10 with C language...learned new concepts of C++ standard templates...finally accepted.GOOOOOOOOD QUESTion... 
Added by:  BLANKRK 
Date:  20140128 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 