845A - Chess Tourney - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin>>n;
    int a[2*n],f=0;

    for(int i=0; i<2*n; i++)
        cin>>a[i];
    sort(a,a+2*n);

    int l=0,u=2*n-1;
    
    while(l<u) {
        if(a[l]>=a[u])
            f=1;
        l++;
        u--;
    }

    if(f==1)
        cout<<"NO\n";
    else
        cout<<"YES\n";
    return 0;
}