Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.005 s | 2 KBi |
#2 |
Incorrecto
|
0.004 s | 2 KBi |
#3 |
Incorrecto
|
0.003 s | 1 KBi |
#4 |
Incorrecto
|
0.005 s | 2 KBi |
#5 |
Incorrecto
|
0.003 s | 1 KBi |
#6 |
Incorrecto
|
0.003 s | 0 KBi |
#7 |
Incorrecto
|
0.004 s | 0 KBi |
#8 |
Incorrecto
|
0.004 s | 0 KBi |
#9 |
Incorrecto
|
0.004 s | 1 KBi |
#10 |
Incorrecto
|
0.004 s | 1 KBi |
#include <iostream> #define ll long long using namespace std; int main(){ int n, c, consu, cont = 0; cin >> n; ll arr[n]; for (int i = 0; i < n; i++){ cin >> arr[i]; } cin >> c; for (int i = 0; i < c; i++){ cont = 0; cin >> consu; for (int j = 0; j < n; j++){ if (arr[j] > consu) cont++; } cout << cont; } }