题目链接:http://codeforces.com/contest/337/problem/A
1、首先对所有m个数字排序,每次枚举连续n个数,求首尾差的最小值。
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[55];
int ans=2147483647;
int main(){
int n,m;
while(scanf("%d%d",&n,&m)==2){
for(int i=0;i<m;i++)
scanf("%d",&a[i]);
sort(a,a+m);
int i=0,j=i+n-1;
while(j<=m-1){
ans=min(ans,a[j]-a[i]);
i++;j++;
}
printf("%d\n",ans);
}
return 0;
}