Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 22 KBi |
#2 |
Correcto
|
0.005 s | 1 KBi |
#3 |
Correcto
|
0.004 s | 2 KBi |
#4 |
Correcto
|
0.005 s | 19 KBi |
#5 |
Correcto
|
0.004 s | 1 KBi |
#6 |
Correcto
|
0.003 s | 16 KBi |
#7 |
Correcto
|
0.004 s | 51 KBi |
#8 |
Correcto
|
0.005 s | 2 KBi |
#9 |
Correcto
|
0.004 s | 1 KBi |
#10 |
Correcto
|
0.004 s | 1 KBi |
#include <stdio.h> int main(void) { int i, b, x, m, count; int c[1024]; int d[1024]; scanf("%d", &b); for(i = 0; i < b; i++) { scanf("%d", &c[i]); } scanf("%d", &x); for(i = 0; i < x; i++) { scanf("%d", &d[i]); } for(i = 0; i < x; i++) { count = 0; for(m = 0; m < b; m++) { if(d[i] < c[m]) count++; } printf("%d\n", count); } return 0; }