Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.087 s | 9 KBi |
#2 |
Incorrecto
|
0.119 s | 9 KBi |
#3 |
Incorrecto
|
0.098 s | 9 KBi |
#4 |
Incorrecto
|
0.1 s | 9 KBi |
#5 |
Incorrecto
|
0.116 s | 9 KBi |
#6 |
Correcto
|
0.095 s | 9 KBi |
#7 |
Correcto
|
0.119 s | 9 KBi |
#8 |
Correcto
|
0.097 s | 9 KBi |
#9 |
Incorrecto
|
0.119 s | 9 KBi |
#10 |
Incorrecto
|
0.115 s | 9 KBi |
#11 |
Correcto
|
0.111 s | 9 KBi |
#12 |
Correcto
|
0.089 s | 9 KBi |
n = gets.to_i a = gets.split.map(&:to_i) def solve(array) min_number = -1000000001 last_number = min_number array.each do |numb| if last_number >numb return "Desordenado" end end return "Ordenado" end puts(solve(a))