70求助qwq

#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
template<typename T> void read(T&x){
	int sign=1;x=0;char c;
	do{
		c=getchar();
		if(c=='-') sign=-1;
	}while(!isdigit(c));
	do{
		x=x*10+c-'0';
		c=getchar();
	}while(isdigit(c));
	x*=sign;
}
int n,l,r;
int a[110];
struct op{
	int x,y;
}b[110];
int ans=0;
bool cmp(op x,op y){
	return x.x<y.x;
}
int sum;
signed main(){
	read(n);
	for(int i=1;i<=n;i++){
		read(a[i]);
		ans+=a[i];
	}
	sort(a+1,a+1+n);
	read(l); read(r);
	if(ans>r*n){
		cout<<-1;
		return 0;
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
				b[j].x=a[j];
				b[j].y=j;
			}
		sort(b+1,b+1+n,cmp);
		if(a[i]>r){
			for(int j=1;j<=n;j++){
				if((b[j].x+a[i]-r)<=r){
					a[b[j].y]=b[j].x+a[i]-r;
					sum+=a[i]-r;
					a[i]=r; 
					break;
				}
				if((b[j].x+a[i]-r)>r){
					sum+=r-b[j].x;
					a[b[j].y]=r;
					a[i]=a[i]-(r-b[j].x);
				}
			}
		}
		else if(a[i]<l){
			for(int j=n;j>=1;j--){
				if(b[j].x-(l-a[i])>=l){
					a[b[j].y]=b[j].x-(l-a[i]);
					sum+=(l-a[i]);
					a[i]=l;
					break;
				}
				if(b[j].x-(l-a[i])<l){
					a[b[j].y]=l;
					sum+=b[j].x-l;
					a[i]+=b[j].x-l;
				}
			}
		}
		else{
			continue;
		}
	}
	if(sum<0){
		cout<<-1;
		return 0;
	}
	cout<<sum;
	return 0;
}