M题这样哪错了

#include <bits/stdc++.h>

using namespace std;

#define ll long long

#define f first

#define s second

int main(){

multiset<ll>s;

ll v[100010]={0};

ll A[100010]={0};

ll i,j=1,n,a;

cin>>n;

for(i=0;i<n;i++){

cin>>a;

s.insert(a);

v[i]=a;

}

sort(v,v+n);

if(n!=2&&((v[1]*2)<=v[n-1])){

A[0]=*(s.rbegin())-*(s.begin());

}else{

A[0]=1000000000000;

}

for(i=0;i<n;i++){

s.erase(s.find(v[i]));

s.insert(2*v[i]);

A[j]=*(s.rbegin())-*(s.begin());

j++;

}

sort(A,A+j);

cout<<A[0];

return 0;

}