AC代码:
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
const int maxn=1e6+5;
int a[maxn],b[maxn],c[maxn];
main(){
int t;
cin>>t;
while(t--){
memset(c,0,sizeof(c));
int n,m,s,f;
cin>>n>>m>>s>>f;
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=n;i++)cin>>b[i];
for(int i=1;i<=n;i++)c[a[i]]++,c[b[i]]--;
for(int i=0;i<f;i++)c[i]+=c[i-1];
int maxx=0,minn=1e10,flag=1;
for(int i=s;i<f;i++){
if(c[i]<m)flag=0;
maxx=max(maxx,c[i]);
minn=min(minn,c[i]);
}
if(flag)cout<<"YES"<<" "<<maxx<<endl;
else cout<<"NO"<<" "<<minn<<endl;
}
}