57
правок
Изменения
→Псевдокод
return x.Peek() < y.Peek()
PriorityQueue<Stack<E>> q(piles, comparePiles)
'''for'''(i = 0..n - 1)
answer[i] = q.Min().Pop()
answer[n - 1] = piles[piles.size - 1].Top
E prev = answer[n - 1].Previous()
'''for'''(i = n - 2..0)
answer[i]=prev
prev = answer[i].Previous()
