Envío 6787
Problema 0x62 - Contar elementos mayores a X en un arreglo pequeño
- Autor: DscNNcT
- Fecha: 2022-11-29 19:40:30 UTC (Hace 2 meses)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.015 s | 3 KBi |
| #2 |
Correcto
|
0.016 s | 3 KBi |
| #3 |
Correcto
|
0.021 s | 3 KBi |
| #4 |
Correcto
|
0.018 s | 3 KBi |
| #5 |
Correcto
|
0.02 s | 3 KBi |
| #6 |
Correcto
|
0.014 s | 3 KBi |
| #7 |
Correcto
|
0.02 s | 3 KBi |
| #8 |
Correcto
|
0.019 s | 3 KBi |
| #9 |
Correcto
|
0.021 s | 3 KBi |
| #10 |
Correcto
|
0.026 s | 3 KBi |
Puntos totales: 100 / 100
Código
n = int(input())
a = [int(x) for x in input().split()]
c = int(input())
k = 0
r = []
while k < c:
ans = 0
i = int(input())
for each in a:
if each > i:
ans += 1
r.append(ans)
k += 1
for each in r:
print(each)