Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.015 s | 3 KBi |
#2 |
Correcto
|
0.017 s | 3 KBi |
#3 |
Correcto
|
0.013 s | 3 KBi |
#4 |
Correcto
|
0.015 s | 3 KBi |
#5 |
Correcto
|
0.019 s | 3 KBi |
#6 |
Correcto
|
0.016 s | 3 KBi |
#7 |
Correcto
|
0.016 s | 3 KBi |
#8 |
Correcto
|
0.016 s | 3 KBi |
#9 |
Correcto
|
0.015 s | 3 KBi |
#10 |
Correcto
|
0.014 s | 3 KBi |
#11 |
Correcto
|
0.018 s | 3 KBi |
#12 |
Correcto
|
0.014 s | 3 KBi |
n = int(input()) datos= input().split() def ordernado(n, datos): for i in range(0,n): if(i<n-1): if(int(datos[i])>int(datos[i+1])): return("Desordenado") return("Ordenado") print(ordernado(n, datos))