Envío 1406
Problema 0xdd - Ordenar un arreglo pequeño
- Autor: Andres Ariza
- Fecha: 2020-10-25 17:09:35 UTC (Hace alrededor de 4 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.02 s | 3 KBi |
| #2 |
Correcto
|
0.029 s | 3 KBi |
| #3 |
Correcto
|
0.026 s | 3 KBi |
| #4 |
Correcto
|
0.02 s | 3 KBi |
| #5 |
Correcto
|
0.028 s | 3 KBi |
| #6 |
Correcto
|
0.026 s | 3 KBi |
| #7 |
Correcto
|
0.017 s | 3 KBi |
| #8 |
Correcto
|
0.018 s | 3 KBi |
| #9 |
Correcto
|
0.019 s | 3 KBi |
| #10 |
Correcto
|
0.021 s | 3 KBi |
| #11 |
Correcto
|
0.148 s | 3 KBi |
| #12 |
Correcto
|
0.159 s | 3 KBi |
| #13 |
Correcto
|
0.226 s | 3 KBi |
| #14 |
Correcto
|
0.041 s | 3 KBi |
| #15 |
Correcto
|
0.039 s | 3 KBi |
| #16 |
Correcto
|
0.032 s | 3 KBi |
| #17 |
Correcto
|
0.345 s | 3 KBi |
| #18 |
Correcto
|
0.247 s | 3 KBi |
| #19 |
Correcto
|
0.181 s | 3 KBi |
| #20 |
Correcto
|
0.279 s | 3 KBi |
Puntos totales: 100 / 100
Código
N = int(input())
arr = [eval(num) for num in input().split()]
for i in range(N):
swapped = False
for j in range(N-1-i):
if arr[j] > arr[j+1]:
arr[j],arr[j+1] = arr[j+1],arr[j]
swapped = True
if not swapped:
break
print(*arr, sep=" ")