#include<stdio.h>
#include<stdlib.h>
int cmp(const void *a, const void *b)
{
return *(int *)a - *(int *)b;
}
int main()
{
int t,a[1006],b[1006];
scanf("%d",&t);
while(t--)
{
int n,m;
scanf("%d%d",&n,&m);
for(int i = 0; i < n; i++)
scanf("%d",&a[i]);
for(int i = 0; i < n; i++)
scanf("%d",&b[i]);
qsort(a,n,sizeof(a[0]),cmp);
qsort(b,n,sizeof(a[0]),cmp);
int sum1 = 0,sum2 = 0;
for(int i = 0, j = n - 1; i < m, j > n - 1 - m; i++, j--)
{
sum1 += a[i]; sum2 += b[j];
}
if(sum1 > sum2)
printf("YES\n");
else printf("NO\n");
}
return 0;
}
#include<stdlib.h>
int cmp(const void *a, const void *b)
{
return *(int *)a - *(int *)b;
}
int main()
{
int t,a[1006],b[1006];
scanf("%d",&t);
while(t--)
{
int n,m;
scanf("%d%d",&n,&m);
for(int i = 0; i < n; i++)
scanf("%d",&a[i]);
for(int i = 0; i < n; i++)
scanf("%d",&b[i]);
qsort(a,n,sizeof(a[0]),cmp);
qsort(b,n,sizeof(a[0]),cmp);
int sum1 = 0,sum2 = 0;
for(int i = 0, j = n - 1; i < m, j > n - 1 - m; i++, j--)
{
sum1 += a[i]; sum2 += b[j];
}
if(sum1 > sum2)
printf("YES\n");
else printf("NO\n");
}
return 0;
}