Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.003 s | 4 KBi |
#2 |
Correcto
|
0.005 s | 0 KBi |
#3 |
Correcto
|
0.006 s | 0 KBi |
#4 |
Correcto
|
0.004 s | 0 KBi |
#5 |
Correcto
|
0.005 s | 7 KBi |
#6 |
Correcto
|
0.006 s | 0 KBi |
#7 |
Correcto
|
0.005 s | 0 KBi |
#8 |
Correcto
|
0.005 s | 0 KBi |
#9 |
Correcto
|
0.005 s | 0 KBi |
#10 |
Correcto
|
0.003 s | 1 KBi |
#11 |
Correcto
|
0.005 s | 0 KBi |
#12 |
Correcto
|
0.006 s | 0 KBi |
#include <bits/stdc++.h> using namespace std; bool solve(vector<int> &arr) { for (int i = 0; i < arr.size()-1; ++i) if (arr[i] > arr[i+1]) return false; return true; } int main() { int n; cin >> n; vector<int> arr(n); for (auto &num : arr) cin >> num; cout << (solve(arr) ? "Ordenado" : "Desordenado") << endl; return 0; }