#include <bits/stdc++.h>
using namespace std;
int n;
int a[55];
int l,r;
int lo,up;
int cnt;
int main(){
	cin>>n;
	for(int i=1; i<=n; i++) cin>>a[i];
	cin>>l>>r;
	for(int i=1; i<=n; i++){
		cnt+=a[i];
		if(a[i]<l) lo+=l-a[i];
		else if(a[i]>r) up+=a[i]-r;
	}
	if(cnt<l*n||cnt>r*n) cout<<-1;
	else cout<<max(lo,up);
}

#include<bits/stdc++.h>
using namespace std;
long long n,s;
struct C
{
    long long t,j,c;
}a[1026];
bool cmp(C x,C y)
{
    if(x.t!=y.t)return x.t<y.t;
    return x.j<y.j;
}
int main()
{
    cin >> n;
    for(int i=1;i<=n;i++)
    {
        cin >> a[i].t;
        a[i].j=i;
    }
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<=n;i++)
    {
        a[i].c=a[i-1].c+a[i-1].t;
        s+=a[i].c;
        cout << a[i].j << " ";
    }
    cout << endl;
    printf("%.2f",s*1.00/n);
}

???

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define rrep(i, a, b) for (int i = a; i >= b; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define pb push_back
#define MP make_pair
#define all(v) v.begin(), v.end()
#define clr(v) v.clear()
#define isEven(x) !(x & 1)
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
int main() {
	ios::sync_with_stdio ( false );
	cin.tie ( 0 );
	int a[10];
	long long A,b,c,x,y,z,cnt=0;
	cin>>A>>b>>c;
	for(int i=1;i<=9;i++)a[i]=i;
	do{
		x=a[1]*100+a[2]*10+a[3];
		y=a[4]*100+a[5]*10+a[6];
		z=a[7]*100+a[8]*10+a[9];
		if(x*b==y*A&&y*c==z*b)printf("%lld %lld %lld\n",x,y,z),cnt++;
		
	}while(next_permutation(a+1,a+10));
	if(!cnt)puts("No!!!");
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
bool panduan(int a)
{
	int b=a%10;
	int c=(a/10)%10;
	int d=a/100;
	if(b==c||c==d||d==b)
	{
		return 0;
	}
	else{
		return 1;
	}
		
}
bool panduanb(int a,int b,int c)
{
	int x1=a%10;
	int x2=(a/10)%10;
	int x3=a/100;
	int x4=b%10;
	int x5=(b/10)%10;
	int x6=b/100;
	int x7=c%10;
	int x8=(c/10)%10;
	int x9=c/100;
	if(x1==x2||x1==x3||x1==x4||x1==x5||x1==x6||x1==x7||x1==x8||x1==x9||x2==x3||x2==x4||x2==x5||x2==x6||x2==x7||x2==x8||x2==x9||x3==x4||x3==x5||x3==x6||x3==x7||x3==x8||x3==x9||x4==x5||x4==x6||x4==x7||x4==x8||x4==x9||x5==x6||x5==x7||x5==x8||x5==x9||x6==x7||x6==x8||x6==x9||x7==x8||x7==x9||x8==x9)
	{
		return 0;
	}
	else{
		if(x1==0||x2==0||x3==0||x4==0||x5==0||x6==0||x7==0||x8==0||x9==0)
		{
			return 0;
		}
		else{
			return 1;
		}
		
	}
}
int main() {
	int a,b,c;
	int n=0;
	cin>>a>>b>>c;
	for(int i=123;i<=987;++i)
	{
		if(i%a==0&&a!=0)
		{
			if(panduan(i)&&panduan(i*b/a)&&panduan(i*c/a))
			{
				if(i*b/a<1000&&i*c/a<1000)
				{
					if(panduanb(i,i*b/a,i*c/a))
					{
						++n;
						cout<<i<<" "<<i*b/a<<" "<<i*c/a<<endl;	
					}
					
				}
				
			}
		}
		
	}
	if(n==0)
	{
		cout<<"No!!!";
	}
	return 0;
}

#include<bits/stdc++.h> using namespace std; long long n,s; struct C { long long t,j,c; }a[1026]; bool cmp(C x,C y) { if(x.t!=y.t)return x.t<y.t; return x.j<y.j; } int main() { cin >> n; for(int i=1;i<=n;i++) { cin >> a[i].t; a[i].j=i; } sort(a+1,a+n+1,cmp); for(int i=1;i<=n;i++) { a[i].c=a[i-1].c+a[i-1].t; s+=a[i].c; cout << a[i].j << " "; } cout << endl; printf("%.2f",s*1.00/n); }