Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.006 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 1 KBi |
#5 |
Correcto
|
0.005 s | 1 KBi |
#6 |
Correcto
|
0.006 s | 1 KBi |
#7 |
Correcto
|
0.005 s | 1 KBi |
#8 |
Correcto
|
0.005 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.005 s | 1 KBi |
#11 |
Correcto
|
0.006 s | 60 KBi |
#12 |
Correcto
|
0.005 s | 1 KBi |
#include <iostream> using namespace std; int main(void) { long lenght, previous, current; bool isSorted = true; cin >> lenght; cin >> previous; for (long i = 1; i < lenght; i++) { cin >> current; if (current < previous) { isSorted = false; break; } previous = current; } cout << ((isSorted) ? "Ordenado" : "Desordenado") << endl; return 0; }