Codeforces Round #317 [AimFund Thanks-Round] (Div. 2)A Arrays

最新推荐文章于 2020-05-21 21:50:59 发布

原创最新推荐文章于 2020-05-21 21:50:59 发布 · 323 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

水题专栏收录该内容

159 篇文章

订阅专栏

本文介绍了一个简单的编程问题，即判断是否可以从两个已排序的整数数组A和B中分别选择k个和m个数，使得所有从A中选择的数都严格小于从B中选择的数。通过排序和直接比较的方法，快速解决了这一问题。

思路：水题

#include<bits\stdc++.h>
using namespace std;
const int maxn = 1e5+6;
int a[maxn];
int b[maxn];
int main()
{
    int n1,n2;
	scanf("%d%d",&n1,&n2);
	int k,m;
	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]);
	sort(a+1,a+1+n1);
	sort(b+1,b+1+n2);
	if(a[k] < b[n2-m+1])
		puts("YES");
	else
		puts("NO");
}

You are given two arrays A and B consisting of integers, sorted in non-decreasing order. Check whether it is possible to choose knumbers in array A and choose m numbers in array B so that any number chosen in the first array is strictly less than any number chosen in the second array.

Input

The first line contains two integers nA, nB (1 ≤ nA, nB ≤ 105), separated by a space — the sizes of arrays A and B, correspondingly.

The second line contains two integers k and m (1 ≤ k ≤ nA, 1 ≤ m ≤ nB), separated by a space.

The third line contains nA numbers a1, a2, ... anA ( - 109 ≤ a1 ≤ a2 ≤ ... ≤ anA ≤ 109), separated by spaces — elements of array A.

The fourth line contains nB integers b1, b2, ... bnB ( - 109 ≤ b1 ≤ b2 ≤ ... ≤ bnB ≤ 109), separated by spaces — elements of array B.

Output

Print "YES" (without the quotes), if you can choose k numbers in array A and m numbers in array B so that any number chosen in arrayA was strictly less than any number chosen in array B. Otherwise, print "NO" (without the quotes).

Examples

input
3 3
2 1
1 2 3
3 4 5

output
YES

input
3 3
3 3
1 2 3
3 4 5

output
NO

input
5 2
3 1
1 1 1 1 1
2 2

output
YES

Note

In the first sample test you can, for example, choose numbers 1 and 2 from array A and number 3 from array B (1 < 3 and 2 < 3).

In the second sample test the only way to choose k elements in the first array and m elements in the second one is to choose all numbers in both arrays, but then not all the numbers chosen in A will be less than all the numbers chosen in B: $\text{[math]}$ .