Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.005 s | 1 KBi |
#3 |
Correcto
|
0.005 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 1 KBi |
#5 |
Correcto
|
0.006 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.005 s | 1 KBi |
#8 |
Correcto
|
0.004 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.006 s | 1 KBi |
#11 |
Correcto
|
0.005 s | 1 KBi |
#12 |
Correcto
|
0.005 s | 5 KBi |
#include <iostream> #include <vector> #include <cassert> using namespace std; int main() { int n; cin >> n; assert(n >= 1); bool sorted = true; int previous; cin >> previous; for (int i = 0; i < n; ++i) { int current; cin >> current; if (previous > current) { sorted = false; } previous = current; } if (sorted) { cout << "Ordenado" << endl; } else { cout << "Desordenado" << endl; } return 0; }