Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.03 s | 3 KBi |
#2 |
Correcto
|
0.021 s | 3 KBi |
#3 |
Correcto
|
0.028 s | 3 KBi |
#4 |
Correcto
|
0.02 s | 3 KBi |
#5 |
Correcto
|
0.029 s | 3 KBi |
#6 |
Correcto
|
0.017 s | 3 KBi |
#7 |
Correcto
|
0.021 s | 3 KBi |
#8 |
Correcto
|
0.029 s | 3 KBi |
#9 |
Correcto
|
0.018 s | 3 KBi |
#10 |
Correcto
|
0.02 s | 3 KBi |
#11 |
Correcto
|
0.027 s | 3 KBi |
#12 |
Correcto
|
0.022 s | 3 KBi |
n = int(input()) numbers = list(map(int, input().split())) assert len(numbers) == n is_sorted = all(numbers[i] <= numbers[i+1] for i in range(n - 1)) if is_sorted: print("Ordenado") else: print("Desordenado")