Codeforces Round #774 (Div. 2) 1646B - Quality vs Quantity Solution
///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,t,i;
cin>>t;
while(t--)
{
cin>>n;
long long a[n+9],mid,s1=0;
for(i=0; i<n; i++)
{
cin>>a[i];
}
sort(a,a+n);
for (i=0; i<(n-1)/2+1; i++)
{
s1+=a[i];
}
for (i=0;i<(n-1)/2;i++)
{
s1-=a[n-1-i];
}
if(s1<0)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
}
No comments