74. Invert a bincount

Hard

Given an array C where C[i] is the number of times the value i should appear, produce a sorted 1-D array A that contains exactly C[i] copies of each value i, for every i from 0 to len(C) - 1.

Implement solve(...)