Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.029 s | 3 KBi |
#2 |
Correcto
|
0.026 s | 3 KBi |
#3 |
Correcto
|
0.027 s | 3 KBi |
#4 |
Correcto
|
0.03 s | 6 KBi |
#5 |
Correcto
|
0.027 s | 3 KBi |
#6 |
Correcto
|
0.039 s | 6 KBi |
#7 |
Correcto
|
0.027 s | 3 KBi |
#8 |
Correcto
|
0.026 s | 3 KBi |
#9 |
Correcto
|
0.027 s | 3 KBi |
#10 |
Correcto
|
0.035 s | 3 KBi |
n = int(input()) lst = [int(x) for x in input().split()] lst.sort() c = int(input()) consult = [] for i in range(c): consult.append(int(input())) for num in consult: res, j = 0, n - 1 while j > -1 and lst[j] > num: res += 1 j -= 1 print(res)