Ada and dishes

Problem code:ADADISH
#include <bits/stdc++.h>
using namespace std;

int main() {
	
	int t,n;
	cin>>t;
	while(t--)
	{
	cin>>n;
	int c[n];
	for(int i=0;i<n;i++)
	cin>>c[i];
	if(n==1)
{	cout<<c[0]<<endl;
  continue;}
  sort(c,c+n);
	reverse(c,c+n);

 int first=c[0],ans=0;
	 int second=c[1],a,b;
	
	for(int i=2;i<n;i++)
	{ 
	    a=first;
	    b=second;
	   if(first>second)
	   { 
	      first-=second;
	       second=c[i];
	      
	   }
	   else if(first<second)
	   {   second-=first;
	       first=c[i];
	      
	   }
	   else
	   {
	       first=0;
	       second=c[i];
	   }
	   ans+=min(a,b);
	   
	  }
	  int maxi=max(first,second);
	  cout<<ans+maxi<<endl;

	}
	
	
	return 0;
}