Codeforces Round #774 (Div. 2) 1646B - Quality vs Quantity Solution

 

                                              


Problem Link:https://codeforces.com/contest/1646/problem/B

Solution in C++:

///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

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.