SORT AGAIN 看错题意啦。wa了好几次。。5555555

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>

int A[5100];
int B[10100];

int main( )
{
int T, N, k, max , t, num, i, j;
scanf("%d",&T);
while(T--)
{
num = 0;
max = 0;
memset(B, 0, sizeof(B));
scanf("%d%d",&N, &k);
for (i = 0; i < N; i++)
scanf("%d",&A[i]);
for (i = 0; i < N; i++)
for (j = i + 1; j < N; j++) {
t = abs(A[i] - A[j]);
if (t > max)
max = t;
B[t]++;
}
for (i = 0; ; i++ ) {
if(B[i] != 0) {
num++;
if (num == k) {
printf("%d\n",i);
break;
}
}
}

}
return 0;
}