/* Natus Vincere
    Born To Conquer */

#include <bits/stdc++.h>
#define ll long long int
#define pi 3.1415926535897932385
#define mod 1000000007
#define db double
#define pp(x) pair<x,x>
#define ff first
#define ss second
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define tc ll tc; cin>>tc ; cin.ignore(5,'\n'); for(ll number = 1 ; number <= tc ; number ++ )
#define vv(x) vector<x >
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof  pop_front
#define endl "\n"
#define umap unordered_map
#define pq priority_queue
#define dbg(x) { cout<< #x << ": " << (x) << endl; }
#define dbg2(x,y) { cout<< #x << ": " << (x) << " , " << #y << ": " << (y) << endl; }
#define bp ll kkk; cin >>kkk;
#define dbgArr(a,n) cout<<"Array "<<#a<<endl; for(ll i=0 ; i<n ; i++) cout<<a[i]<<" "; cout<<endl;
#define forn(i,n) for(ll i=0 ; i<n ; i++)
#define forn1(i,n) for(ll i=1 ; i<=n ; i++)
#define arr(a,n) for(ll i=0;i<n;i++){ cin>>a[i]; }
#define arr1(a,n) for(ll i=1;i<=n;i++){ cin>>a[i]; }
#define file freopen("inp.in","r",stdin); freopen("outp.out","w",stdout)
#define print cout<<"Case #"<<number<<": "
#define all(x) x.begin(), x.end()
#define trav(x, a) for(auto &x: a)
#define inf 1e18 ;

using namespace std ;

ll query(vector<ll> v , ll ts)
{
    ll x,y ; cin>>x>>y ;
    ll minc=0 ;
    ll idx=lower_bound(all(v),x)-v.begin();

    ll a ;

    if(idx==v.size())
    {
    	idx-- ;
    	a=v[idx];
    	minc=max(0LL,x-a)+max(0LL,y-ts+a);
    	return minc ;
    }

    a=v[idx];
    minc=max(0LL,x-a)+max(0LL,y-ts+a);

    a=v[idx+1];
    minc=min(minc , max(0LL,x-a)+max(0LL,y-ts+a));
    return minc ;
}

int main()
{
    FIO
    ll n ; cin>>n ;
    vector<ll> v(n) ; arr(v,n); sort(all(v));
    ll ts=accumulate(v.begin(),v.end(),0);
    tc cout<<query(v,ts)<<endl;
    return 0 ;
}