Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.023 s | 3 KBi |
#2 |
Correcto
|
0.022 s | 3 KBi |
#3 |
Correcto
|
0.022 s | 3 KBi |
#4 |
Correcto
|
0.02 s | 3 KBi |
#5 |
Correcto
|
0.022 s | 3 KBi |
#6 |
Correcto
|
0.02 s | 3 KBi |
#7 |
Correcto
|
0.024 s | 4 KBi |
#8 |
Correcto
|
0.02 s | 3 KBi |
#9 |
Correcto
|
0.021 s | 3 KBi |
#10 |
Correcto
|
0.021 s | 3 KBi |
#11 |
Correcto
|
0.021 s | 3 KBi |
#12 |
Correcto
|
0.022 s | 3 KBi |
n = int(input()) l = [int(x) for x in input().split()] last = l[0] sorted = True for i in range(1,n): if l[i] < last: sorted = False break last = l[i] if sorted: print("Ordenado") else: print("Desordenado")