【codeforce1592B】Hemose Shopping

​​https://codeforces.com/contest/1592/problem/B​​

分析

#include <bits/stdc++.h>
using namespace std; 
int T,n,x,a[100010]={0},b[100010]={0};
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&x);
        for(int i=0;i<n;i++)scanf("%d",&a[i]),b[i]=a[i];
        if(n>=2*x)puts("YES");
        else
        {
            sort(b,b+n);
            int flag=1;
            for(int i=n-x;i<x;i++)if(a[i]!=b[i]){flag=0;break;}
            if(!flag)puts("NO");
            else puts("YES");
        }
    }
    return 0;
}