Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 2 KBi |
#2 |
Correcto
|
0.006 s | 2 KBi |
#3 |
Correcto
|
0.004 s | 1 KBi |
#4 |
Correcto
|
0.004 s | 1 KBi |
#5 |
Correcto
|
0.005 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.004 s | 1 KBi |
#8 |
Correcto
|
0.005 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 2 KBi |
#10 |
Correcto
|
0.004 s | 1 KBi |
#include <stdio.h> #include <stdlib.h> int main() { int sizeArray; scanf("%d", &sizeArray); int *array; array = malloc(sizeArray * sizeof(int)); for (int i = 0; i < sizeArray; i++) scanf("%d", &array[i]); int sizeQuerie; scanf("%d", &sizeQuerie); int *arrayQueries; arrayQueries = malloc(sizeQuerie * sizeof(int)); for (int i = 0; i < sizeQuerie; i++) { int value = 0; scanf("%d", &arrayQueries[i]); for (int num = 0; num < sizeArray; num++) { if (arrayQueries[i] < array[num]) value++; } printf("%d\n", value); } return 0; }