Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.017 s | 3 KBi |
#2 |
Correcto
|
0.02 s | 3 KBi |
#3 |
Correcto
|
0.035 s | 8 KBi |
#4 |
Correcto
|
0.027 s | 4 KBi |
#5 |
Correcto
|
0.032 s | 7 KBi |
#6 |
Correcto
|
0.026 s | 3 KBi |
#7 |
Correcto
|
0.023 s | 3 KBi |
#8 |
Correcto
|
0.024 s | 4 KBi |
#9 |
Correcto
|
0.019 s | 3 KBi |
#10 |
Correcto
|
0.019 s | 3 KBi |
#11 |
Correcto
|
0.014 s | 3 KBi |
#12 |
Correcto
|
0.017 s | 3 KBi |
n = input() array = input() a = [int(x) for x in array.split()] n = int(n) flag = True for x in range(1, n): if a[x] < a[x-1]: flag = False print('Desordenado') break if flag == True: print('Ordenado')