Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.008 s | 1 KBi |
#2 |
Correcto
|
0.004 s | 1 KBi |
#3 |
Correcto
|
0.008 s | 1 KBi |
#4 |
Correcto
|
0.007 s | 1 KBi |
#5 |
Correcto
|
0.006 s | 1 KBi |
#6 |
Correcto
|
0.006 s | 2 KBi |
#7 |
Correcto
|
0.006 s | 1 KBi |
#8 |
Correcto
|
0.008 s | 1 KBi |
#9 |
Correcto
|
0.006 s | 1 KBi |
#10 |
Correcto
|
0.006 s | 2 KBi |
#11 |
Correcto
|
0.006 s | 1 KBi |
#12 |
Correcto
|
0.004 s | 1 KBi |
#include <iostream> #include <vector> int main() { int n; long number, num = -999999999; bool sort = 1; std::cin >> n; for (int i = 0; i < n; ++i){ std::cin >> number; if (number >= num) { num = number; } else { num = number; sort = 0; } } if (sort) std::cout << "Ordenado\n"; else std::cout << "Desordenado\n"; return 0; }