fork(2) download
copy 
  1. #include<stdio.h>
  2. #include<algorithm>
  3. int main()
  4. {
  5.     int n,k,T,i,x,x1,p,y;
  6.     long long int arr1[20000],arr2[20000],min,t;
  7.     scanf("%d",&T);
  8.     for(x=0;x<T;x++)
  9.     {
  10.       i=0;
  11.       scanf("%d%d",&n,&k);
  12.       for(x1=0;x1<n;x1++)
  13.       scanf("%lld",&arr1[x1]);
  14.  
  15.      //sort
  16.    /*for(x1=0;x1<n;x1++)
  17.    {
  18.       p=x1;
  19.       for(y=x1+1;y<n;y++)
  20.       {
  21.       if(arr1[y]<arr1[p])
  22.       p=y;
  23.       }
  24.      t=arr1[x1];
  25.      arr1[x1]=arr1[p];
  26.      arr1[p]=t;
  27.    }*/
  28.  
  29. std::sort(arr1,arr1+n);
  30.      t=0;
  31.      while((i+k-1)<n){
  32.  
  33.      arr2[i]=arr1[i+k-1]-arr1[i];
  34.  
  35.      t++;
  36.      i++;
  37.      }
  38.  
  39.  min=arr2[0];
  40.    for(x1=0;x1<t;x1++)
  41.    {
  42.    if(arr2[x1]<min)
  43.    min=arr2[x1];
  44.    }
  45. printf("%lld\n",min);
  46. }
  47. return 0;
  48. }
Success #stdin #stdout 0s 3096KB
comments (?)
stdin
copy 
3 
3 1 
2 5 4  
3 2 
5 2 4  
3 3 
2 5 4
stdout
copy 
0
1
3
https://ideone.com/3x4asR
language:
C++ (gcc 8.3)
created:
10 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!