Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 1 KBi |
#2 |
Correcto
|
0.003 s | 1 KBi |
#3 |
Correcto
|
0.004 s | 2 KBi |
#4 |
Correcto
|
0.003 s | 1 KBi |
#5 |
Correcto
|
0.004 s | 1 KBi |
#6 |
Correcto
|
0.006 s | 2 KBi |
#7 |
Correcto
|
0.004 s | 1 KBi |
#8 |
Correcto
|
0.006 s | 1 KBi |
#9 |
Correcto
|
0.004 s | 2 KBi |
#10 |
Correcto
|
0.006 s | 1 KBi |
#11 |
Correcto
|
0.005 s | 1 KBi |
#12 |
Correcto
|
0.004 s | 1 KBi |
#include <stdio.h> #include <stdlib.h> int main() { // Write C code here int size; scanf("%d", &size); int *array; array = malloc(size * sizeof(int)); for (int i = 0; i < size; i++) { int value; scanf("%d", &value); array[i] = value; if (i >= 1) { if (array[i - 1] > array[i]) { printf("Desordenado\n"); free(array); return (0); } } } printf("Ordenado\n"); free(array); return 0; }