Jim and arrays

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    
    long long i,j,k,n,m,p,q,min;
    cin>>n;
    long long a[n];
    for(i=0;i<n;i++)
        cin>>a[i];
    cin>>p>>q;
    long long b[q-p+1];
    for(i=p;i<=q;i++)
    {   
        min=1000000000;
        for(j=0;j<n;j++)
          {
            m=abs(a[j]-i);
            
            if(m<min)
                min=m;
            
        }
        b[i-p]=min;
        cout<<b[i-p]<<" ";
    }
    sort (b,b+q-p+1);
    cout<<b[q-p+1];
    return 0;
}