def qsum(l, r):
    if not l:
        return pref[r]
    return pref[r] - pref[l - 1]


n = int(input())
a = list(map(int, input().split()))
a.sort()
pref = [0] * n
pref[0] = a[0]
for i in range(1, n):
    pref[i] = pref[i - 1] + a[i]
k = int(input())
for i in range(k):
    x = int(input())
    l, r = -1, n
    while r - l > 1:
        m = (l + r) // 2
        if a[m] < x:
            l = m
        else:
            r = m
    t = qsum(r, n - 1) - (n - r) * x
    print(t)