#include #include #include #include #include #include #include int cmpfunc (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]); } qsort(a, n, sizeof(a[0]), cmpfunc); int min = 100000; for (int i = 0; i < n -1 ; i++) { int diff = abs((a[i] - a[i + 1])); if (diff < min) min = diff; } printf("%d", min); return 0; }