This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
#include <algorithm>
using namespace std;
using ll = long long;
const int N = 2e5 + 10;
const ll oo = 1e18;
int n, a[N], best = 1e9;
vector <int> res;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
}
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
best = a[n - 1] - a[0];
for (int i = 0; i < n; ++i)
res.push_back(a[i]);
for (int i = n - 1; i > 0; --i) {
vector <int> cur;
cur.clear();
int cur_res;
for (int j = 0; j < n; ++j)
cur.push_back(a[j]);
reverse(cur.begin() + i, cur.end());
cur_res = abs(cur[0] - cur.back());
for (int j = 0; j < n - 1; ++j)
cur_res = max(cur_res, abs(cur[j] - cur[j + 1]));
if (cur_res < best) {
best = cur_res;
res = cur;
}
}
cout << best << "\n";
for (int i = 0; i < n; ++i)
cout << res[i] << ' ';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |