Codeforces Round #807 (Div. 2) 1705A - Mark the Photographer Solution


 

Problem Link: https://codeforces.com/contest/1705/problem/A

Solution in C++:

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long   x,t,i,j,d,e,n,v,r;
    cin>>t;
    while(t--)
    {
        r=0;
        cin>>n>>x;
        v=n*2;
        int a[v];
        for(i=0; i<v; i++)cin>>a[i];
        sort(a,a+v);
        for(i=0; i<n; i++)
        {
            d=a[n+i]-a[i];
            if(d<x)
            {
                r=1;
                break;
            }
        }
        if(r==1)
            cout<<"No"<<endl;
        else
            cout<<"Yes"<<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.