Envío 5333

Código

#include <bits/stdc++.h>

using namespace std;
#define vi vector<int>

int binarySearch2(vi &arr, int x, int l, int r) {
    while (l <= r) {
        int mid = l + (r - l) / 2;
        if (arr[mid] > x && arr[mid-1] <= x) return mid;

        if (arr[mid] <= x) l = mid + 1;
        else r = mid - 1;
    }
    return -1;
}


int main() {
    int n, c, x;
    cin >> n;
    vi nums(n);

    for (auto &x : nums) cin >> x;
    sort(nums.begin(), nums.end());

    cin >> c;
    while (c--) {
        cin >> x;
        // int ans = binarySearch2(nums, x, 0, nums.size()-1);
        int ans = *upper_bound(nums.begin(), nums.end(), x);
        cout << (ans ? n - (ans - 1) : 0) << endl;
    } 
    return 0;
}