题解

直接判断 $max$ 在不在最后一项 在就 YES 否则是 NO
代码

# include <bits/stdc++.h>
typedef unsigned long long ull;

#define endl '\n'

using  namespace  std ;
int  main ( )
{
	int n,k1,k2,arn,maxi = 0;
    cin>>n>>k1>>k2;
    vector<int>arr(n);
    for(int i = 0;i<n-1;i++){
        cin>>arr[i];
        maxi = max(maxi,arr[i]);
    }
    cin>>arn;
    if(maxi>arn) cout<<"YES";
    else cout<<"NO";
	return  0;
}