int main() { int a[MAXN]; int i = 0; int minus =0, abso = 0; int n1 = 0, n2 = 1; while (scanf_s(“%d”, &a[i]) == 1) { i++; } //先給陣列排序 sort(a, a + i); **for (int m = 1; m < i; m++) { int n = m - 1; abso = abs(a[m] - a[n]); if (abso < minus) { minus = abso; n1 = m; n2 = n; } }** for (int j = 0; j < i; j++) { printf(“%d\n”, a[j]); } printf(“%d %d\n”, a[n1], a[n2]); system(“pause”); return 0; }