Envío 5157
Problema 0x62 - Contar elementos mayores a X en un arreglo pequeño
- Autor: Sergio.Urrego
- Fecha: 2021-10-20 05:34:20 UTC (Hace alrededor de 3 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.026 s | 4 KBi |
| #2 |
Correcto
|
0.026 s | 3 KBi |
| #3 |
Correcto
|
0.026 s | 4 KBi |
| #4 |
Correcto
|
0.03 s | 3 KBi |
| #5 |
Correcto
|
0.021 s | 3 KBi |
| #6 |
Correcto
|
0.022 s | 3 KBi |
| #7 |
Correcto
|
0.028 s | 5 KBi |
| #8 |
Correcto
|
0.024 s | 3 KBi |
| #9 |
Correcto
|
0.028 s | 3 KBi |
| #10 |
Correcto
|
0.027 s | 4 KBi |
Puntos totales: 100 / 100
Código
arr_len = int(input())
data = [int(x) for x in input().split()]
count_comp = int(input())
for i in range(count_comp):
counter = 0
compare_data = int(input())
for j in range(arr_len):
if compare_data < data[j]:
counter += 1
print(counter)