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.005 s | 1 KBi |
#5 |
Correcto
|
0.002 s | 0 KBi |
#6 |
Correcto
|
0.002 s | 0 KBi |
#7 |
Correcto
|
0.002 s | 0 KBi |
#8 |
Correcto
|
0.004 s | 0 KBi |
#9 |
Correcto
|
0.004 s | 0 KBi |
#10 |
Correcto
|
0.006 s | 0 KBi |
#11 |
Correcto
|
0.005 s | 22 KBi |
#12 |
Correcto
|
0.001 s | 0 KBi |
// Look if an array of numbers is ordered #include <bits/stdc++.h> using namespace std; int main(){ int n, k; cin >> n; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; bool sorted = true; // k starting as the first element, then being replaced by the current number k = arr[0]; for (int element : arr){ if (element < k){ sorted = false; break; } k = element; } // if else one liner string r = (sorted == true) ? "Ordenado" : "Desordenado"; cout << r; }