Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.009 s | 3 KBi |
#2 |
Incorrecto
|
0.019 s | 3 KBi |
#3 |
Incorrecto
|
0.015 s | 3 KBi |
#4 |
Incorrecto
|
0.009 s | 3 KBi |
#5 |
Incorrecto
|
0.007 s | 3 KBi |
#6 |
Incorrecto
|
0.017 s | 3 KBi |
#7 |
Incorrecto
|
0.007 s | 3 KBi |
#8 |
Incorrecto
|
0.015 s | 3 KBi |
#9 |
Incorrecto
|
0.018 s | 3 KBi |
#10 |
Incorrecto
|
0.009 s | 3 KBi |
#11 |
Incorrecto
|
0.017 s | 3 KBi |
#12 |
Incorrecto
|
0.021 s | 3 KBi |
n = int(input()) arreglo = input().split() def estaOrdenado(n,arreglo): for i in range(0,n): if(i<n-1): if(int(arreglo[i])>int(arreglo[i+1])): return("esta desordenado") return("esta ordenado") print(estaOrdenado(n, arreglo))