题解

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int m,a[n];
    for (int i=0;i<n;i++)
    {
        cin >> a[i];
    }
    cin >> m;
    sort(a,a+n);
    while (m--)
    {
        int question;
        cin >> question;
        cout << n-(int)(upper_bound(a,a+n,question)-a) << endl;
    }
    return 0;
}