Envío 3236
Problema 0x62 - Contar elementos mayores a X en un arreglo pequeño
- Autor: Salacho65
- Fecha: 2021-03-06 20:59:44 UTC (Hace alrededor de 3 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.027 s | 3 KBi |
| #2 |
Correcto
|
0.025 s | 3 KBi |
| #3 |
Correcto
|
0.028 s | 3 KBi |
| #4 |
Correcto
|
0.032 s | 3 KBi |
| #5 |
Correcto
|
0.026 s | 3 KBi |
| #6 |
Correcto
|
0.027 s | 3 KBi |
| #7 |
Correcto
|
0.028 s | 3 KBi |
| #8 |
Correcto
|
0.03 s | 3 KBi |
| #9 |
Correcto
|
0.031 s | 3 KBi |
| #10 |
Correcto
|
0.035 s | 3 KBi |
Puntos totales: 100 / 100
Código
size = int(input())
arr = [int(x) for x in input().split(" ")]
queries = int(input())
dicc = dict()
for i in range(queries):
ans = 0
query = int(input())
if query in dicc:
print(dicc[query])
else:
for i in range(len(arr)):
if arr[i] > query:
ans+=1
dicc[query] = ans
print(ans)