Closest Numbers

You are given a sorted list of N numbers and a number Num. Write a program to find the five numbers that are closest (numerically) to Num. A number x in the array is closest to Num if |Num-x| is the smallest among all such x possible.

Note: If the Num is present in given list, then it should be in the output.

Constraints:
        5 < N <20
        All numbers in list are between -10000 to 10000
        -10000 <Num< 10000
        There could be numbers that are repeated
Input:      
    N Num
    m1 m2 m3 .. mN
where mi's are N numbers in sorted order.

Output:
    p1 p2 p3 p4 p5
where pi's are closest numbers in increasing order of absolute difference from Num. If there are two numbers with same difference, print the larger one first.

Solution-

#include<stdio.h>

#define MAXSIZE 20



/*
  Write a function for printing 5 closest numbers
*/
void printclosest(int arr[], int num, int n){

  int b[n],i,j,c[n],temp;
 
  for(i=0;i<n;i++)
  {b[i]=i;

   if(num>=arr[i])
     c[i]=num-arr[i];
   else
     c[i]=arr[i]-num;
 
  }
 
  for(i=0;i<5;i++)
  {
    for(j=i;j<n;j++)
    {if(c[i]>=c[j])
    {
   
     
      temp=c[i];c[i]=c[j];
      c[j]=temp;temp=b[i];
      b[i]=b[j];
      b[j]=temp;
    }
    }}
    for(i=0;i<4;i++)
    {
      printf("%d ",arr[b[i]]);
    }
  printf("%d",arr[b[4]]);
   
 
}
int main()
{
  int arr[MAXSIZE];
  int i,n,num;
  scanf("%d %d",&n,&num);
  for (i = 0; i < n; ++i)
{
  scanf("%d",&arr[i]);
}
  printclosest(arr, num, n);
  return 0;
}