Codeforces Good Bye 2019-A Card Game

简单模拟

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<cstdlib>
//#include<windows.h>
#define fi first
#define se second
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
#define mes(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
const int N = 1e6+10;
const int INF = 0x3f3f3f3f;
const int inf = - INF;
const int mod = 1e9+7;
const double pi = acos(-1.0);

int a[1005],b[1005];
int main(){
    int T;
    cin>>T;
    while(T--){
        int n,k1,k2;
        cin>>n>>k1>>k2;
        int mx1=-1,mx2=-1,mn1=INF,mn2=INF;
        rep(i,1,k1){
            cin>>a[i];
            mx1=max(mx1,a[i]);
            mn1=min(mn1,a[i]);
        }
        rep(i,1,k2){
            cin>>b[i];
            mx2=max(mx2,b[i]);
            mn2=min(mn2,b[i]);
        }
        if(mx2<mn1) cout<<"YES"<<endl;
        else{
            if(mx1>mx2) cout<<"YES"<<endl;
            else cout<<"NO"<<endl;
        }
    }
    //system("pause");
    return 0;
}