#include <iostream> #include <vector> #include <algorithm> #include <climits> using namespace std; int main() { int n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } // 排序数组 sort(a.begin(), a.end()); // 初始化最小距离为一个很大的值 long long minDist = LLONG_MAX; // 遍历相邻元素，计算差值 for (int i = 1; i < n; i++) { long long diff = a[i] - a[i - 1]; if (diff < minDist) { minDist = diff; } } cout << minDist << endl; return 0; }