void solve(){ int n; cin>>n; vector v(n); for(int i=0;i<n;i++) { cin>>v[i];

}
sort(v.begin(),v.end());
if(n==1||n==2)
cout<<0<<endl;
else
{
    vector<int> p;
    int a=0;
    for(int i=0;i<n;i++)
    {
        a+=v[i];
    }
    int b=0;

    int d=0;
    vector<int> q(n,0);
    for(int i=1;i<n;i++)
    {
        d+=v[i-1];
        q[i]=d;
    }

    p.push_back(a-v[1]);
    for(int i=2;i<n;i++)
    {
        int c=a-v[i];

        p.push_back(c+(i-1)*v[i]-q[i]);

    }



    sort(p.begin(),p.end());
    cout<<-1*p[p.size()-1]<<endl;

}

} This is my solution, Please help