Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.13 s | 16 KBi |
#2 |
Incorrecto
|
0.143 s | 14 KBi |
#3 |
Incorrecto
|
0.135 s | 13 KBi |
#4 |
Incorrecto
|
0.114 s | 14 KBi |
#5 |
Incorrecto
|
0.141 s | 16 KBi |
#6 |
Incorrecto
|
0.138 s | 14 KBi |
#7 |
Incorrecto
|
0.151 s | 14 KBi |
#8 |
Incorrecto
|
0.158 s | 17 KBi |
#9 |
Incorrecto
|
0.148 s | 18 KBi |
#10 |
Incorrecto
|
0.162 s | 14 KBi |
import java.util.Scanner; public class Main{ public static void main(String[] args) { Scanner inp = new 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"); } inp.close(); } }