Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.006 s | 1 KBi |
#2 |
Incorrecto
|
0.005 s | 1 KBi |
#3 |
Incorrecto
|
0.005 s | 1 KBi |
#4 |
Incorrecto
|
0.006 s | 1 KBi |
#5 |
Incorrecto
|
0.005 s | 1 KBi |
#6 |
Incorrecto
|
0.005 s | 1 KBi |
#7 |
Incorrecto
|
0.006 s | 1 KBi |
#8 |
Incorrecto
|
0.005 s | 1 KBi |
#9 |
Incorrecto
|
0.006 s | 1 KBi |
#10 |
Incorrecto
|
0.005 s | 1 KBi |
#11 |
Incorrecto
|
0.006 s | 1 KBi |
#12 |
Incorrecto
|
0.007 s | 1 KBi |
#include <iostream> using namespace std; int main(){ int tam; bool orden = true; cin >> tam; int N[tam]; for (int i=0; i<tam;i++){ cin>>N[i]; } for (int j=0;j<tam-1;j++){ if (N[j+1] < N[j]) orden = false; } if (orden) cout << "ordenado" << endl; else cout << "desordenado" << endl; return 0; }