CF#317DIV.2,ProblemA,水题

By L_FW, contest: Codeforces Round #317 [AimFund Thanks-Round] (Div. 2), problem: (A) Arrays, Accepted

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN=100010;

int nA,nB,k,m;
int A[MAXN],B[MAXN];

int main(){
    scanf("%d%d",&nA,&nB);
    scanf("%d%d",&k,&m);
    for(int i=0;i<nA;i++) scanf("%d",&A[i]);
    for(int i=0;i<nB;i++) scanf("%d",&B[i]);
    if(A[k-1]<B[nB-m]) printf("YES\n");
    else printf("NO\n");
}