Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.077 s | 17 KBi |
#2 |
Incorrecto
|
0.122 s | 13 KBi |
#3 |
Incorrecto
|
0.085 s | 16 KBi |
#4 |
Incorrecto
|
0.132 s | 13 KBi |
#5 |
Incorrecto
|
0.14 s | 13 KBi |
#6 |
Incorrecto
|
0.135 s | 14 KBi |
#7 |
Incorrecto
|
0.087 s | 17 KBi |
#8 |
Incorrecto
|
0.096 s | 17 KBi |
#9 |
Incorrecto
|
0.1 s | 17 KBi |
#10 |
Incorrecto
|
0.146 s | 14 KBi |
class Main { public static void main(String[] args) { java.util.Scanner inp = new java.util.Scanner(System.in); int n = inp.nextInt(); int numbers[] = new int[n]; for(int i = 0; i < n; i++) { numbers[i] = inp.nextInt(); } int queries = inp.nextInt(); for(int i = 0; i < queries; i++) { int x = inp.nextInt(); int contador = 0; for(int j = 0; j < n; j++) { if(numbers[j] > x) contador++; } System.out.println(contador + "\n"); } } }