Help me in solving MAJIK problem

help
,
1

My issue

plz debug this code

My code

#include <bits/stdc++.h>
#define ll long long int
using namespace std;

int main() {
	// your code goes here
	ll t;
	cin>>t;
	while(t--){
	    ll n,p,q;
	    cin>>n>>p>>q;
	    ll y=p+q;
	    vector<ll>v(n);
	    for(ll i=0;i<n;i++){
	        cin>>v[i];
	    }
	    sort(v.begin(),v.end());
	    // take last and first element
	    ll ans=v.back()-v.front();
	  // make absolute
	    for(auto &element:v){
	        if(element !=v[0] ||element !=v[n-1] ){
	        element=abs(element);}
	    }
	      
	         sort(v.begin()+1,v.end()-1);
	         
	      for(ll i=n-2;i>0;i--){
	          if(y==0){
	              break;
	          }else{
	               ans+=v[i];
	              y--;
	          }
	      }
	      cout<<ans<<endl;
	}
	
	return 0;
}

Problem Link: MAJIK Problem - CodeChef