Order by Set Bits

Difficulty: 1100 3500 ms 128 MB

sorting

Sort the values by the number of 1-bits in their binary form; break ties by the value itself (ascending).

Input: the first line has N; the second line has N integers.

Output: the values in the required order.

Constraints:

• 1 ≤ N ≤ 10⁵
• 0 ≤ a_i ≤ 10⁹

Sample Tests

5
12 5 30 7 19

5 12 7 19 30

2
100 2

2 100

Read the Editorial