Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.003 s | 0 KBi |
#2 |
Correcto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.004 s | 0 KBi |
#4 |
Correcto
|
0.008 s | 1 KBi |
#5 |
Correcto
|
0.006 s | 1 KBi |
#6 |
Correcto
|
0.006 s | 2 KBi |
#7 |
Correcto
|
0.009 s | 1 KBi |
#8 |
Correcto
|
0.005 s | 1 KBi |
#9 |
Correcto
|
0.003 s | 0 KBi |
#10 |
Correcto
|
0.005 s | 1 KBi |
#11 |
Correcto
|
0.007 s | 2 KBi |
#12 |
Correcto
|
0.004 s | 2 KBi |
#include <iostream> using namespace std; long long vector[1000]; int main() { long long n; cin >> n; for (int i = 0; i < n; i++) { cin >> vector[i]; } for (int i = 0; i < n; i++) { if (i > 0) { if (vector[i - 1] > vector[i]) { cout << "Desordenado" << endl; return 0; } } } cout << "Ordenado" << endl; return 0; }