Envío 5123
Problema 0x62 - Contar elementos mayores a X en un arreglo pequeño
- Autor: ciberdiego123
- Fecha: 2021-10-18 13:07:27 UTC (Hace alrededor de 3 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.02 s | 3 KBi |
| #2 |
Correcto
|
0.02 s | 3 KBi |
| #3 |
Correcto
|
0.026 s | 3 KBi |
| #4 |
Correcto
|
0.028 s | 5 KBi |
| #5 |
Correcto
|
0.028 s | 3 KBi |
| #6 |
Correcto
|
0.026 s | 3 KBi |
| #7 |
Correcto
|
0.017 s | 3 KBi |
| #8 |
Correcto
|
0.02 s | 3 KBi |
| #9 |
Correcto
|
0.035 s | 7 KBi |
| #10 |
Correcto
|
0.027 s | 3 KBi |
Puntos totales: 100 / 100
Código
from bisect import bisect_right
n = int(input())
nums = [int(i) for i in input().split()]
c = int(input())
nums.sort()
for i in range(c):
x = int(input())
print(n - bisect_right(nums, x))