Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.012 s | 3 KBi |
#2 |
Incorrecto
|
0.013 s | 3 KBi |
#3 |
Incorrecto
|
0.011 s | 3 KBi |
#4 |
Incorrecto
|
0.016 s | 3 KBi |
#5 |
Incorrecto
|
0.01 s | 3 KBi |
#6 |
Incorrecto
|
0.012 s | 3 KBi |
#7 |
Incorrecto
|
0.013 s | 3 KBi |
#8 |
Incorrecto
|
0.012 s | 3 KBi |
#9 |
Incorrecto
|
0.011 s | 3 KBi |
#10 |
Incorrecto
|
0.013 s | 3 KBi |
#11 |
Incorrecto
|
0.056 s | 3 KBi |
#12 |
Incorrecto
|
0.065 s | 3 KBi |
#13 |
Incorrecto
|
0.066 s | 3 KBi |
#14 |
Incorrecto
|
0.056 s | 3 KBi |
#15 |
Incorrecto
|
0.049 s | 3 KBi |
#16 |
Incorrecto
|
0.057 s | 3 KBi |
#17 |
Incorrecto
|
0.1 s | 3 KBi |
#18 |
Incorrecto
|
0.062 s | 3 KBi |
#19 |
Incorrecto
|
0.074 s | 3 KBi |
#20 |
Incorrecto
|
0.058 s | 3 KBi |
n = int(input()) lista = [int(n) for n in input().split()] def bubble_sort(lista): n = len(lista) for i in range(n): for j in range(0, n-i-1): if lista[j] > lista[j+1]: lista[j], lista[j+1] = lista[j+1], lista[j] return lista bubble_sort(lista)