1705A - Mark the Photographer - CodeForces Solution


greedy sortings *800

Please click on ads to support us..

Python Code:

r=lambda:map(int,input().split());t,=r();exec(t*"n,x=r();a=sorted(r());print('YNEOS'[any(v-u<x for u,v in zip(a[:n],a[n:]))::2]);")

C++ Code:

#include<bits/stdc++.h>
using namespace std;
void solve()
{
    int n, i, k, f=0, y;
    cin >> n >> k;
    int x = 2*n;
    vector<int> v, v1, v2;
    for(i=0; i<x; i++)
    {
        cin >> y;
        v.push_back(y);
    }
    sort(v.begin(),v.end());
    for(i=0; i<n; i++)
    {
        if(v[i+n]-v[i]<k)
        {
            f=1;
        }
    }
    if(f==1)
    {
        cout << "NO" << endl;
    }
    else
    {
        cout << "YES" << endl;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin>>t;
    while(t--)
    {
        solve();

    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1613B - Absent Remainder
1536B - Prinzessin der Verurteilung
1699B - Almost Ternary Matrix
1545A - AquaMoon and Strange Sort
538B - Quasi Binary
424A - Squats
1703A - YES or YES
494A - Treasure
48B - Land Lot
835A - Key races
1622C - Set or Decrease
1682A - Palindromic Indices
903C - Boxes Packing
887A - Div 64
755B - PolandBall and Game
808B - Average Sleep Time
1515E - Phoenix and Computers
1552B - Running for Gold
994A - Fingerprints
1221C - Perfect Team
1709C - Recover an RBS
378A - Playing with Dice
248B - Chilly Willy
1709B - Also Try Minecraft
1418A - Buying Torches
131C - The World is a Theatre
1696A - NIT orz
1178D - Prime Graph
1711D - Rain
534A - Exam