Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 2 KBi |
#2 |
Correcto
|
0.005 s | 1 KBi |
#3 |
Correcto
|
0.004 s | 11 KBi |
#4 |
Correcto
|
0.007 s | 1 KBi |
#5 |
Correcto
|
0.006 s | 11 KBi |
#6 |
Correcto
|
0.007 s | 2 KBi |
#7 |
Correcto
|
0.006 s | 25 KBi |
#8 |
Correcto
|
0.006 s | 13 KBi |
#9 |
Correcto
|
0.006 s | 29 KBi |
#10 |
Correcto
|
0.008 s | 1 KBi |
#include <iostream> #include <vector> using namespace std; int main() { int tam, num, query, cont; vector <int> numbers; cin >> tam; while( tam-- ){ cin >> num; numbers.push_back(num); } cin >> query; while ( query-- ){ cont = 0; cin >> num; for(int i=0;i<numbers.size();i++){ if(num < numbers[i]){ cont++; } } cout << cont << endl; } return 0; }