#include<bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i=a;i<b;i++)
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
const int mod = 1e9 + 7;
const long long INF = 1e18L + 5;
const int mxn = 2e5 + 1;
int cnt = 1;
void solve()
{
  ll n,x,y;
  cin>>n;
  vi v(n);
  rep(i,0,n)
  cin>>v[i];
  sort(v.begin(),v.end());
  vi pre = v;
  rep(i,1,n)
  pre[i]+=pre[i-1];
  ll q;
  cin>>q;
  while(q--)
  {
    cin>>x>>y;
    ll ans = INF;
    ll pos = std::lower_bound(v.begin(),v.end(),x) - v.begin();
    ll need = 0;
    if(pos==n)
    {
      ans = x - v[pos-1] + max(ll(0) , y - pre[n-1] + v[pos-1]);
    }
    else if(pos!=0)
    {
      ans = min(max(ll(0) , x - v[pos]) +  max(ll(0) , y - pre[n-1] + v[pos]) , max(ll(0) , x - v[pos-1]) +  max(ll(0) , y - pre[n-1] + v[pos-1]));
    }
    else
    {
      ans = max(ll(0) , x - v[pos]) +  max(ll(0) , y - pre[n-1] + v[pos]);
    }
    cout<<ans<<"\n";
  }

 
}
int main()
{
    fastIO;
    int t = 1;
    //cin>>t;
    while(t--)
    {
        solve();
        cnt++;
    }
    return 0;
}