Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.005 s | 2 KBi |
#3 |
Correcto
|
0.005 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 1 KBi |
#5 |
Correcto
|
0.004 s | 1 KBi |
#6 |
Correcto
|
0.004 s | 1 KBi |
#7 |
Correcto
|
0.005 s | 1 KBi |
#8 |
Correcto
|
0.005 s | 7 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.006 s | 1 KBi |
#include <iostream> #include <vector> #include <algorithm> using namespace std; #define ll long long #define D(x) cout << #x << " " << x << endl int main() { ll n, q, ai, x; cin >> n; vector<ll> a(n); for(int i = 0; i < n; ++i) cin >> a[i]; sort(a.begin(), a.end()); cin >> q; while(q--) { cin >> x; vector<ll>::iterator up = upper_bound(a.begin(), a.end(), x); cout << n - (up - a.begin()) << endl; } return 0; }