레이팅 미적용... Take these cards, \(I\) tell ya, \(my\) cousin from Sweden sent them when the hunger for war
was at its peak, and we stayed playing rummy in the trenches.
Daniel: “Are we playin’ rummy, eh?”
Domagoj: “Well ok then.”
Daniel: “Watch this now. You have a deck of \(N\) cards, where the \(i^{th}\) card has a claim written
on it in the form of ‘At least \(a_{i}\) cards beneath this one contain a false claim.’ You have to
shuffle them so that exactly \(K\) cards contain a false claim.”
Domagoj: “You destroy me in this game every time, where did you get these cards, son?!”
Daniel: “Ah, my old man organizes card tournaments, so each day he gives me free cards,
ten bucks per deck.”
Your task is to help Domagoj solve Daniel’s task. Output the order in which Domagoj must
place the cards. It is also possible that this is a bad joke on Daniel’s part, and that there is no
possible order to place the cards in. In that case, output -1.
In test cases worth 30% of total points, it will hold \(N \le 16\).
In additional test cases worth 40% of total points, it will hold \(N \le 2000\).
The first line contains integers \(N\) and \(K\) (\(1 \le N \le 5 \cdot 10^{5}\), \(0 \le K \le N\)).
The \(i^{th}\) of the following \(N\) lines contains an integer \(a_{i}\) (\(0 \le a_{i} \le 5 \cdot 10^{5}\)).
If the required order does not exist, output -1.
Otherwise, in a single line, output \(N\) integers separated by spaces, the numbers on the cards
in the order from the top to the bottom of the deck. If there are multiple solutions, output
any.
4 2
1
2
2
3
2 3 1 2
5 3
2
1
3
0
3
3 3 0 1 2
6 4
0
2
5
2
0
1
-1