Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.023 s | 3 KBi |
#2 |
Correcto
|
0.023 s | 3 KBi |
#3 |
Correcto
|
0.025 s | 3 KBi |
#4 |
Correcto
|
0.02 s | 3 KBi |
#5 |
Correcto
|
0.021 s | 3 KBi |
#6 |
Correcto
|
0.019 s | 3 KBi |
#7 |
Correcto
|
0.021 s | 3 KBi |
#8 |
Correcto
|
0.02 s | 3 KBi |
#9 |
Correcto
|
0.023 s | 3 KBi |
#10 |
Correcto
|
0.021 s | 3 KBi |
#11 |
Correcto
|
0.024 s | 3 KBi |
#12 |
Correcto
|
0.023 s | 3 KBi |
#13 |
Correcto
|
0.024 s | 3 KBi |
#14 |
Correcto
|
0.022 s | 3 KBi |
#15 |
Correcto
|
0.025 s | 3 KBi |
#16 |
Correcto
|
0.023 s | 3 KBi |
#17 |
Correcto
|
0.022 s | 3 KBi |
#18 |
Correcto
|
0.027 s | 3 KBi |
#19 |
Correcto
|
0.023 s | 3 KBi |
#20 |
Correcto
|
0.022 s | 3 KBi |
from heapq import heapify, heappop def heapsort(l): heapify(l) res = [] while l: res.append(heappop(l)) return res if __name__ == "__main__": N = int(input()) l = list(map(int, input().split(" "))) res = heapsort(l) print(" ".join(map(str, res)))