Envío 826
Problema 0x62 - Contar elementos mayores a X en un arreglo pequeño
- Autor: javierandresgp
- Fecha: 2020-09-23 21:26:59 UTC (Hace alrededor de 4 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.022 s | 3 KBi |
| #2 |
Correcto
|
0.021 s | 3 KBi |
| #3 |
Correcto
|
0.021 s | 3 KBi |
| #4 |
Correcto
|
0.023 s | 5 KBi |
| #5 |
Correcto
|
0.021 s | 3 KBi |
| #6 |
Correcto
|
0.023 s | 3 KBi |
| #7 |
Correcto
|
0.026 s | 3 KBi |
| #8 |
Correcto
|
0.025 s | 3 KBi |
| #9 |
Correcto
|
0.026 s | 3 KBi |
| #10 |
Correcto
|
0.024 s | 3 KBi |
Puntos totales: 100 / 100
Código
elements = int(input())
strNumbers = input()
numbers = strNumbers.split(" ")
queries = int(input())
while(queries > 0):
query = int(input())
count = 0
for number in numbers:
n = int(number)
if n <= query:
count += 1
print(elements - count)
queries -= 1