题解

#include<iostream>
#include<algorithm>
using namespace std;

int main(){
    unsigned int n{},m{};
    unsigned int a[100010]{},b[100010]{};
    cin>>n;
    for (int i=0;i<n;i++) cin>>a[i];
    cin>>m;
    for (int i=0;i<m;i++) cin>>b[i];
    sort(a,a+n);
    for (int i=0;i<m;i++){
        int low=b[i];
        auto left=upper_bound(a,a+n,0);
        auto right=lower_bound(a,a+n,low);
        cout<<right-left<<endl;
    }
    return 0;
}