# your code goes here
import sys
from bisect import bisect_right

def main():
    # Fast I/O reading all input at once
    input_data = sys.stdin.read().split()
    if not input_data:
        return
    
    iterator = iter(input_data)
    
    n = int(next(iterator))
    
    # Read array b (1-indexed matching C++ logic)
    b = [int(next(iterator)) for _ in range(n)]
    
    # Sort the array (0-indexed in Python)
    b.sort()
    
    # Calculate prefix sums
    prefix = [0] * (n + 1)
    for i in range(1, n + 1):
        prefix[i] = prefix[i - 1] + b[i - 1]
        
    total_sum = prefix[n]
    
    q = int(next(iterator))
    
    results = []
    for _ in range(q):
        target = int(next(iterator))
        
        # bisect_right finds the count of elements <= target
        # which directly corresponds to 'g' in your C++ code
        g = bisect_right(b, target)
        
        left_part = target * g - prefix[g]
        right_part = (total_sum - prefix[g]) - target * (n - g)
        
        results.append(str(left_part + right_part))
        
    # Print all results separated by newline
    sys.stdout.write('\n'.join(results) + '\n')