最优解

#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n);
for (int i = 0; i < n; ++i){
cin >> a[i];
}
sort(a.begin(), a.end());
int m;
cin >> m;
while (m--){
int num;
cin >> num;
auto it = upper_bound(a.begin(), a.end(), num);
int count = a.end() - it;
cout << count << "\n";
}
return 0;
}