题解

#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int t;
cin>>t;
for(int i=0;i<t;i++){
int n,x;
cin>>n>>x;
int array[111110]={},backup_copy[111110]={};
for(int j=0;j<n;j++){
cin>>array[j];
backup_copy[j]=array[j];
}
sort(backup_copy,backup_copy+n);
if(x>n/2){
bool cando=1;
for(int j=n-x;j<x;j++){
if(backup_copy[j]!=array[j]){
cout<<"NO\n";
cando=0;
break;
}
}
if(cando)cout<<"YES\n";
}
else cout<<"YES\n";
}
return 0;
}