踢劫

求出最小差值即可
我使用sort排序后再枚举两个数的差

#include <iostrea>
#include <algorith>
using namespace std;

int main() {
    int T;
    cin >> T;
    while(T--) {
        int n,minn = 1e9 + 7;
        cin >> n;
        int a[n];
        for(int i = 0;i < n;i++) {
            cin >> a[i];
        }
        sort(a,a + n);
        for(int i = 1;i < n;i++) minn = min(minn,a[i] - a[i - 1]);
        cout << minn << endl;
    }
    return 0;
}

goodbye～～