Oops!! It seems some javascript files did not load. Please hard reload(SHIFT + reload) your page.

There is a rod of length N lying on x-axis with its left end at x = 0 and right end at x = N. Now, there are M weak points on this rod denoted by positive integer values(all less than N) A_{1}, A_{2}, …, A_{M}. You have to cut rod at all these weak points. You can perform these cuts in any order. After a cut, rod gets divided into two smaller sub-rods. Cost of making a cut is the length of the sub-rod in which you are making a cut.

Your aim is to minimise this cost. Return an array denoting the sequence in which you will make cuts. If two different sequences of cuts give same cost, return the lexicographically smallest.

**Notes**:

- Sequence a_{1}, a_{2} ,…, a_{n} is lexicographically smaller than b_{1}, b_{2} ,…, b_{m}, if and only if at the first i where a_{i} and b_{i} differ, a_{i} < b_{i}, or if no such i found, then n < m.

- N can be upto 10^{9}.

For example,

```
N = 6
A = [1, 2, 5]
If we make cuts in order [1, 2, 5], let us see what total cost would be.
For first cut, the length of rod is 6.
For second cut, the length of sub-rod in which we are making cut is 5(since we already have made a cut at 1).
For third cut, the length of sub-rod in which we are making cut is 4(since we already have made a cut at 2).
So, total cost is 6 + 5 + 4.
Cut order | Sum of cost
(lexicographically | of each cut
sorted) |
___________________|_______________
[1, 2, 5] | 6 + 5 + 4 = 15
[1, 5, 2] | 6 + 5 + 4 = 15
[2, 1, 5] | 6 + 2 + 4 = 12
[2, 5, 1] | 6 + 4 + 2 = 12
[5, 1, 2] | 6 + 5 + 4 = 15
[5, 2, 1] | 6 + 5 + 2 = 13
So, we return [2, 1, 5].
```

- Hint 1
- Solution Approach
- Complete Solution

782 successful submissions.