시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
4 초 | 512 MB | 75 | 37 | 30 | 50.847% |
Bessie is bored and yet again causing trouble in Farmer John's barn. FJ has $N$ ($1\leq N \leq 10^5$) stacks of haybales. For each $i\in [1,N]$, the $i$th stack has $h_i$ ($1\le h_i\le 10^9$) haybales. Bessie does not want any haybales to fall, so the only operation she can perform is as follows:
What is the lexicographically minimum sequence of heights that Bessie can obtain after some sequence of these operations?
The first line of input contains $N$ and $K$. The $i+1$-st line contains the height of the $i$-th haybale.
Please print out $N$ lines, the $i$-th containing the height of the $i$-th haybale in the solution.
5 3 7 7 3 6 2
6 7 7 2 3
One way that Bessie can swap the stacks is as follows:
7 7 3 6 2 -> 7 7 6 3 2 -> 7 7 6 2 3 -> 7 6 7 2 3 -> 6 7 7 2 3