Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.002 s | 0 KBi |
#2 |
Correcto
|
0.002 s | 0 KBi |
#3 |
Correcto
|
0.005 s | 7 KBi |
#4 |
Correcto
|
0.002 s | 0 KBi |
#5 |
Correcto
|
0.002 s | 0 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.002 s | 0 KBi |
#8 |
Correcto
|
0.004 s | 0 KBi |
#9 |
Correcto
|
0.001 s | 0 KBi |
#10 |
Correcto
|
0.002 s | 0 KBi |
#11 |
Correcto
|
0.002 s | 0 KBi |
#12 |
Correcto
|
0.001 s | 0 KBi |
#include <iostream> using namespace std; int main(){ int N; cin >> N; int *M = new int[N]; for (int*p = M; p < M + N; p++) { cin >> *p; } int i = 1; for (int*p = M; p < M + N; p++) { int c = i; while (i != N) { if (*p > *(M+i)) { cout << "Desordenado"; return 0; } i++; } i = c; i++; } delete [] M; M = nullptr; cout << "Ordenado"; return 0; }