hdu 2523 sort again

<pre name="code" class="cpp"><pre name="code" class="cpp">#include<iostream>
#include<algorithm>
#include<math.h>
#include<cstring>
using namespace std;


int main()
{
    int num1[2000],num2[3000];
	int t;
	int n,k;
	int i,j;
	int cnt;
	scanf("%d",&t);
	while(t--)
	{
		memset(num1,0,sizeof(num1));
		memset(num2,0,sizeof(num2));
		
		scanf("%d%d",&n,&k);
		for(i=0;i<n;i++)
		{
			scanf("%d",&num1[i]);
		}
		
		for(i=0;i<n;i++)
		{
			for(j=i+1;j<n;j++)
			{
				num2[abs(num1[i]-num1[j])]++;
			}
		}
		
		cnt=0;
		for(i=0;i<=2000;i++)//改了这里就行了，节省了点时间 
		{
			if(num2[i]!=0)
			{
				cnt++;
			}
			if(cnt==k)
			{
				printf("%d\n",i);
				break;
			}
		}
	}
	return 0;
}