Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 1 KBi |
#2 |
Correcto
|
0.005 s | 1 KBi |
#3 |
Correcto
|
0.005 s | 1 KBi |
#4 |
Correcto
|
0.006 s | 1 KBi |
#5 |
Correcto
|
0.004 s | 2 KBi |
#6 |
Correcto
|
0.004 s | 1 KBi |
#7 |
Correcto
|
0.004 s | 2 KBi |
#8 |
Correcto
|
0.005 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.008 s | 2 KBi |
#include<stdio.h> int main(){ int n,m; scanf("%d", &n); int arr[n]; for(int i=0; i<n; i++){ scanf("%d", &arr[i]); } scanf("%d", &m); int tot[m], temp; for(int i=0; i<m; i++){ scanf("%d", &temp); int c=0; for(int j=0; j<n; j++){ if(arr[j]>temp) c++; } tot[i]=c; } for(int i=0; i<m; i++){ printf("%d\n",tot[i]); } return 0; }