Chef and Adjacent Sums

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

int main() {
	// your code goes herei
	int t;
	cin>>t;
	while(t--)
	{
	    ll n;
	    cin>>n;
	    ll a[n],i,b[n];
	    unordered_map<int,int>m;
	    for(i=0;i<n;i++)
	    {
	        cin>>a[i];
	        b[i]=a[i];
	        m[a[i]]++;
	    }
	    sort(b,b+n);
	    if(b[n-1]==b[n-2])
	    {
	        int c=m[b[n-1]];
	        int d=n-c;
	        if(d>=(c-1))
	        {
	            cout<<"YES"<<endl;
	        }
	        else
	        {
	            cout<<"NO"<<endl;
	        }
	    }
	    else
	    {
	        int c=m[b[n-2]];
	        if((c+1)==n)
	        {
	            cout<<"NO"<<endl;
	        }
	        else
	        {
	            cout<<"YES"<<endl;
	        }
	    }
	}
	return 0;
}