Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 0 KBi |
#2 |
Correcto
|
0.004 s | 0 KBi |
#3 |
Correcto
|
0.004 s | 0 KBi |
#4 |
Correcto
|
0.005 s | 1 KBi |
#5 |
Correcto
|
0.004 s | 1 KBi |
#6 |
Correcto
|
0.004 s | 0 KBi |
#7 |
Correcto
|
0.006 s | 0 KBi |
#8 |
Correcto
|
0.006 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 0 KBi |
#10 |
Correcto
|
0.004 s | 1 KBi |
#include <iostream> using namespace std; int main() { int N, C; cin >> N; int numbers[N]; for (int i = 0; i < N; i++) { cin >> numbers[i]; } cin >> C; while (C--) { int cont = 0, query; cin >> query; for (int i = 0; i < N; i++) { if (numbers[i] > query) { cont++; } } cout << cont << '\n'; } }