Frequency Array Retrieval

Consider an array $A$ consisting of $N$ positive elements. The *frequency array* of $A$ is the array $B$ of size $N$ such that $B_i =$ *frequency* of element $A_i$ in $A$. For example, if $A = [4, 7, 4, 11, 2, 7, 7]$, the *frequency array* $B = [2, 3, 2, 1, 1, 3, 3]$. You have lost the array $A$, but fortunately you have the array $B$. Your task is to construct the **lexicographically smallest