Envío 6262
Problema 0x62 - Contar elementos mayores a X en un arreglo pequeño
- Autor: Felipe
- Fecha: 2022-05-28 17:10:59 UTC (Hace casi 2 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.013 s | 3 KBi |
| #2 |
Correcto
|
0.011 s | 3 KBi |
| #3 |
Correcto
|
0.012 s | 3 KBi |
| #4 |
Correcto
|
0.013 s | 3 KBi |
| #5 |
Correcto
|
0.011 s | 3 KBi |
| #6 |
Correcto
|
0.024 s | 3 KBi |
| #7 |
Correcto
|
0.011 s | 3 KBi |
| #8 |
Correcto
|
0.01 s | 3 KBi |
| #9 |
Correcto
|
0.022 s | 3 KBi |
| #10 |
Correcto
|
0.011 s | 3 KBi |
Puntos totales: 100 / 100
Código
n = input()
arr = input().split(" ")
arr = [int(i) for i in arr]
c = input()
for t in range(int(c)):
x = int(input())
count = 0
for i in arr:
if i > x:
count += 1
print(count)