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