#include #include #include #include #include #include #include int compare (const void * a, const void * b) { return ( *(int*)a - *(int*)b ); } int main(){ int n; scanf("%d",&n); int *a = malloc(sizeof(int) * n); for(int a_i = 0; a_i < n; a_i++){ scanf("%d",&a[a_i]); } // your code goes here qsort(a,n,sizeof(int),compare); int smallestAbs = abs(a[1]-a[0]); for(int i = 0; i < n-1; i++){ int absVal = abs(a[i]-a[i+1]); if(absVal < smallestAbs) smallestAbs = absVal; } printf("%d",smallestAbs); return 0; }