Envío 1486
Problema 0xdd - Ordenar un arreglo pequeño
- Autor: Serivt
- Fecha: 2020-10-28 02:37:53 UTC (Hace alrededor de 4 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.027 s | 3 KBi |
| #2 |
Correcto
|
0.021 s | 3 KBi |
| #3 |
Correcto
|
0.019 s | 3 KBi |
| #4 |
Correcto
|
0.026 s | 3 KBi |
| #5 |
Correcto
|
0.019 s | 3 KBi |
| #6 |
Correcto
|
0.027 s | 3 KBi |
| #7 |
Correcto
|
0.02 s | 3 KBi |
| #8 |
Correcto
|
0.026 s | 3 KBi |
| #9 |
Correcto
|
0.021 s | 3 KBi |
| #10 |
Correcto
|
0.021 s | 3 KBi |
| #11 |
Correcto
|
0.08 s | 3 KBi |
| #12 |
Correcto
|
0.059 s | 3 KBi |
| #13 |
Correcto
|
0.103 s | 3 KBi |
| #14 |
Correcto
|
0.021 s | 3 KBi |
| #15 |
Correcto
|
0.023 s | 3 KBi |
| #16 |
Correcto
|
0.021 s | 3 KBi |
| #17 |
Correcto
|
0.209 s | 3 KBi |
| #18 |
Correcto
|
0.074 s | 3 KBi |
| #19 |
Correcto
|
0.112 s | 3 KBi |
| #20 |
Correcto
|
0.147 s | 3 KBi |
Puntos totales: 100 / 100
Código
n = int(input())
arr = list(map(int, input().split(" ")))
for i, v in enumerate(arr):
j = i - 1
while j >=0 and v < arr[j] :
arr[j+1] = arr[j]
j -= 1
arr[j + 1] = v
print(" ".join(map(str, arr)))