Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.001 s | 0 KBi |
#2 |
Correcto
|
0.001 s | 0 KBi |
#3 |
Correcto
|
0.002 s | 0 KBi |
#4 |
Correcto
|
0.002 s | 0 KBi |
#5 |
Correcto
|
0.002 s | 0 KBi |
#6 |
Correcto
|
0.002 s | 0 KBi |
#7 |
Correcto
|
0.001 s | 0 KBi |
#8 |
Correcto
|
0.001 s | 0 KBi |
#9 |
Correcto
|
0.001 s | 3 KBi |
#10 |
Correcto
|
0.001 s | 0 KBi |
#11 |
Correcto
|
0.001 s | 0 KBi |
#12 |
Correcto
|
0.001 s | 0 KBi |
#include <iostream> using namespace std; int main() { int n; cin >> n; int numbers[n]; for (int k = 0; k < n; ++k) { cin >> numbers[k]; } bool isOrder = true; for (int i = 0; i < n - 1; i++) { if (numbers[i] > numbers[i + 1]) { cout << "Desordenado"; isOrder = false; break; } } if (isOrder) { cout << "Ordenado"; } return 0; }