#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
int q[1000],p[1000],num[1000];
int fmin(int a,int b)
{
if(a<b)
return a;
return b;
}
int fabs(int a)
{
if(a<0)
return -a;
return a;
}
bool cmp(int a,int b)
{
return a<b;
}
int main()
{
int n,m,s,e,l,r,i,minn;
while(scanf("%d%d",&n,&m)!=EOF)
{
minn=1000000000;
s=0,e=-1,l=0,r=-1;
for(i=0;i<m;i++)
{
scanf("%d",&num[i]);
}
sort(num,num+m,cmp);
for(i=0;i<m;i++)
{
while(s<=e&&num[i]>=num[q[e]])
{
e--;
}
q[++e]=i;
while(s<=e&&i-q[s]>=n)
{
s++;
}
while(l<=r&&num[i]<=num[p[r]])
{
r--;
}
p[++r]=i;
while(l<=r&&i-p[l]>=n)
{
l++;
}
if(i>=n-1&&fabs(q[s]-p[l])<=n)
minn=fmin(minn,fabs(num[q[s]]-num[p[l]]));
}
printf("%d\n",minn);
}
return 0;
}
1.17D
猜你喜欢
转载自blog.csdn.net/weixin_44014347/article/details/86678198
今日推荐
周排行