forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA.cpp
More file actions
32 lines (24 loc) · 931 Bytes
/
A.cpp
File metadata and controls
32 lines (24 loc) · 931 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
using namespace std;
const int MN = 100111;
int na, nb, a[MN], b[MN];
int main() {
ios :: sync_with_stdio(false);
while (cin >> na >> nb) {
int xa, xb; cin >> xa >> xb;
FOR(i,1,na) cin >> a[i];
FOR(i,1,nb) cin >> b[i];
sort(a+1, a+na+1);
sort(b+1, b+nb+1);
if (a[xa] < b[nb - xb + 1]) puts("YES"); else puts("NO");
}
}