Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.012 s | 3 KBi |
#2 |
Correcto
|
0.027 s | 3 KBi |
#3 |
Correcto
|
0.025 s | 3 KBi |
#4 |
Correcto
|
0.011 s | 3 KBi |
#5 |
Correcto
|
0.028 s | 3 KBi |
#6 |
Correcto
|
0.029 s | 3 KBi |
#7 |
Correcto
|
0.026 s | 3 KBi |
#8 |
Correcto
|
0.026 s | 3 KBi |
#9 |
Correcto
|
0.023 s | 5 KBi |
#10 |
Correcto
|
0.028 s | 3 KBi |
#11 |
Correcto
|
0.019 s | 3 KBi |
#12 |
Correcto
|
0.028 s | 3 KBi |
def issorted(x): if x == sorted(x): return 'Ordenado' return 'Desordenado' y = int(input()) y = y if 1 <= y <= 1000 else sys.exit('No cumple 1 <= n <= 1000') x = [int(x) for x in input().split( )] if len(x) > y: x = x[0:y] result = issorted(x) print(result)