CF1537C Challenging Cliffs

思路：

构造。

实现：

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int INF = 0x3f3f3f3f;
 4 int main()
 5 {
 6     int t; cin >> t;
 7     while (t--)
 8     {
 9         int n; cin >> n;
10         vector<int> a(n, 0);
11         for (int i = 0; i < n; i++) cin >> a[i];
12         sort(a.begin(), a.end());
13         int minn = INF;
14         for (int i = 0; i < n - 1; i++) minn = min(minn, a[i + 1] - a[i]);
15         int i = 0;
16         for ( ; i < n - 1; i++)
17         {
18             if (a[i + 1] - a[i] == minn) break;
19         }
20         cout << a[i] << " ";
21         for (int j = i + 2; j < n; j++) cout << a[j] << " ";
22         for (int j = 0; j < i; j++) cout << a[j] << " ";
23         cout << a[i + 1] << endl;
24     }
25     return 0;
26 }