CodeForces #317 (div2) A.Arrays

题目大意：

水题。

解题思路：

水题。

#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<iostream>#include<algorithm>#include<set>#define LL long long#define db double#define maxn 10000000#define EPS 1e-15#define max(a,b) ((a>b)?(a):(b))#define min(a,b) ((a<b)?(a):(b))using namespace std;int main(){int a[100100],b[100100];int n1,n2,k,m;while (scanf("%d%d",&n1,&n2)!=EOF){scanf("%d%d",&k,&m);for (int i=1;i<=n1;i++) scanf("%d",&a[i]);for (int i=1;i<=n2;i++) scanf("%d",&b[i]);if (a[k]<b[n2-m+1]) printf("YES\n");else printf("NO\n");}return 0;}