Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.023 s | 3 KBi |
#2 |
Incorrecto
|
0.021 s | 3 KBi |
#3 |
Incorrecto
|
0.027 s | 3 KBi |
#4 |
Incorrecto
|
0.021 s | 3 KBi |
#5 |
Incorrecto
|
0.023 s | 3 KBi |
#6 |
Incorrecto
|
0.023 s | 3 KBi |
#7 |
Incorrecto
|
0.024 s | 3 KBi |
#8 |
Incorrecto
|
0.029 s | 3 KBi |
#9 |
Incorrecto
|
0.02 s | 3 KBi |
#10 |
Incorrecto
|
0.02 s | 3 KBi |
#11 |
Incorrecto
|
0.025 s | 3 KBi |
#12 |
Incorrecto
|
0.028 s | 3 KBi |
def is_sorted(arr): for n in range(len(arr)-1): if arr[n] <= arr[n+1]: continue else: return "Desordenado" return "Ordenado" if __name__ == "__main__": n = input() x = list(map(int, input().split(" "))) is_sorted(x)