using namespace std;
int main()
{
int q,t,i,j,temp;
cin>>t;
while(t--){
cin>>q;
long long int r[10000],count=0;
for(i=0;i<q;i++)cin>>r[i];
for(i=0;i<q;i++)
for(j=i+1;j<q;j++)
if(r[i]>r[j])
{temp=r[i];
r[i]=r[j];
r[j]=temp;
}
for(i=q-1;i>=0;i=i-2)count+=r[i];
cout<<count<<endl;
}return 0;}
Because your algorithm isn’t efficient. Which problem is this?
Use efficient sorts like quicksort or merge sort.
Thanks tech_boy …!! Quick Sort Worked…!!
Your welcome