#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<long long>
#define MAXK 1000000
#define mapll map<long long,long long>
ll n,q;
ll a[1000005];
ll pre[1000005];
ll tknp(ll x){
    ll l=1,r=n;
    ll ans=-1;
    while(l<=r){
        ll mid=(l+r)/2;
        if(a[mid]>=x){
            ans=mid;
            r=mid-1;
        }else{
            l=mid+1;
        }
    }
    return ans;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    freopen("STEM.inp","r",stdin);
    freopen("STEM.out","w",stdout);
    cin>>n;
    for(ll i=1;i<=n;i++){
        cin>>a[i];
    }
    sort(a+1,a+1+n);
    for(ll i=1;i<=n;i++){
        pre[i]=pre[i-1]+a[i];
    }
    cin>>q;
    while(q--){
        ll x;
        cin>>x;
        ll k=tknp(x);
        if(k==-1){
            cout<<0<<"\n";
            continue;
        }
        cout<<pre[n]-pre[k-1]<<"\n";
    }
    return 0;
}