제출 #239058

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
239058		NONAME	Vrtić (COCI18_vrtic)	C++14	32 / 160	5 ms	384 KiB

vrtic

#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;

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);

    vector <int> res(n);

    res[0] = a[0];
    for (int i = 1; i < n; ++i)
        if (i & 1) res[(i + 1) / 2] = a[i];
            else res[n - (i / 2)] = a[i];

    best = abs(res[0] - res[n - 1]);
    for (int i = 1; i < n; ++i)
        best = max(best, abs(res[i] - res[i - 1]));

    cout << best << "\n";
    for (int i = 0; i < n; ++i)
        cout << res[i] << ' ';
}

• Subtask 1: 16 / 16
• Subtask 2: 16 / 16
• Subtask 3: 0 / 16
• Subtask 4: 0 / 16
• Subtask 5: 0 / 16
• Subtask 6: 0 / 16
• Subtask 7: 0 / 16
• Subtask 8: 0 / 16
• Subtask 9: 0 / 16
• Subtask 10: 0 / 16