Envío 3429
Problema 0x62 - Contar elementos mayores a X en un arreglo pequeño
- Autor: jocarmp08
- Fecha: 2021-03-13 18:11:30 UTC (Hace alrededor de 3 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.029 s | 3 KBi |
| #2 |
Correcto
|
0.029 s | 3 KBi |
| #3 |
Correcto
|
0.029 s | 3 KBi |
| #4 |
Correcto
|
0.061 s | 7 KBi |
| #5 |
Correcto
|
0.027 s | 3 KBi |
| #6 |
Correcto
|
0.059 s | 3 KBi |
| #7 |
Correcto
|
0.03 s | 3 KBi |
| #8 |
Correcto
|
0.031 s | 3 KBi |
| #9 |
Correcto
|
0.026 s | 3 KBi |
| #10 |
Correcto
|
0.039 s | 3 KBi |
Puntos totales: 100 / 100
Código
n = int(input())
list_n = [int(x) for x in input().split()]
c = int(input())
c_list = [int(input()) for _ in range(c)]
count = 0
for i in range(len(c_list)):
ci = c_list[i]
for j in range(n):
nj = list_n[j]
count += 1 if nj > ci else 0
print(count)
count = 0