Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.002 s | 0 KBi |
#2 |
Correcto
|
0.002 s | 0 KBi |
#3 |
Correcto
|
0.002 s | 0 KBi |
#4 |
Correcto
|
0.002 s | 0 KBi |
#5 |
Correcto
|
0.001 s | 0 KBi |
#6 |
Correcto
|
0.005 s | 0 KBi |
#7 |
Correcto
|
0.005 s | 10 KBi |
#8 |
Correcto
|
0.002 s | 0 KBi |
#9 |
Correcto
|
0.003 s | 0 KBi |
#10 |
Correcto
|
0.002 s | 0 KBi |
#11 |
Correcto
|
0.001 s | 0 KBi |
#12 |
Correcto
|
0.005 s | 0 KBi |
// Look if an array of numbers is ordered #include <bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; for (int i = 0; i < n - 1; i++){ if (arr[i] > arr[i + 1]){ cout << "Desordenado"; return 0; } } cout << "Ordenado"; }