Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.022 s | 3 KBi |
#2 |
Correcto
|
0.022 s | 3 KBi |
#3 |
Correcto
|
0.029 s | 3 KBi |
#4 |
Correcto
|
0.02 s | 3 KBi |
#5 |
Correcto
|
0.021 s | 3 KBi |
#6 |
Correcto
|
0.021 s | 3 KBi |
#7 |
Correcto
|
0.02 s | 3 KBi |
#8 |
Correcto
|
0.02 s | 3 KBi |
#9 |
Correcto
|
0.026 s | 3 KBi |
#10 |
Correcto
|
0.025 s | 3 KBi |
#11 |
Correcto
|
0.023 s | 3 KBi |
#12 |
Correcto
|
0.02 s | 3 KBi |
import math def is_sorted(arr): prev = -math.inf for n in arr: if prev > n: return "Desordenado" prev = n return "Ordenado" if __name__ == "__main__": N = int(input()) arr = list(map(int, input().split(" "))) print(is_sorted(arr))