Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <string>
- #include <cmath>
- #include <cstdlib>
- #include <algorithm>
- #include <vector>
- #include <string.h>
- #include <utility>
- #include <queue>
- #include <stack>
- #include <iostream>
- #include <iomanip>
- #include <ctype.h>
- #include <sstream>
- #include <map>
- #include <set>
- #include <stdio.h>
- #include <ctype.h>
- using namespace std;
- #define INF = 2000000000
- #define FOR(i,n) for(int i = 0;i < n;i++)
- #define CLEAR(x) memset((x),0,sizeof(x))
- #define REP(i,a,b) for(int i = (a);i<(b);++i)
- #define MP make_pair
- #define ALL(a) (a).begin(),(a).end()
- #define PB push_back
- #define PII pair<int,int>
- #define sz(a) (int)(a).size()
- typedef long long LL;
- int main() {
- ios_base::sync_with_stdio(0);
- int n,m,k;
- cin >> n >> m >> k;
- vector<int> a;
- vector<int> b;
- int x;
- FOR(i,n){
- cin >> x;
- a.push_back(x);
- }
- FOR(i,m){
- cin >> x;
- b.push_back(x);
- }
- sort(a.begin(),a.end());
- sort(b.begin(),b.end());
- int ai = a.size()-1,bi = b.size()-1;
- int cudo = 0;
- while (1){
- if ((bi < 0 && ai<0))
- break;
- if ((bi < 0 && ai>=0) || a[ai] > b[bi]){
- int el = a[ai];
- while (ai >= 0 && a[ai] == el){
- ai--;
- cudo++;
- }
- if (cudo > 0){
- cout << "YES" << endl;
- return 0;
- }
- } else if ((bi >= 0)) {
- int el = b[bi];
- while (bi >= 0 && b[bi] == el){
- bi--;
- cudo--;
- }
- } else {
- break;
- }
- }
- cout << "NO" << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement