Submission #943935

#TimeUsernameProblemLanguageResultExecution timeMemory
943935RGBBVrtić (COCI18_vrtic)C++14
32 / 160
1 ms464 KiB
#include <bits/stdc++.h>
using namespace std;

const int MAX = 150;

int n;

int a[MAX], b[MAX], outp[MAX];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < n; i++) cin >> b[i];
    sort(b, b + n);
    outp[0] = b[0];
    for(int i = 1; i < n; i++) {
        if(i % 2) outp[(i + 1) / 2] = b[i];
        else outp[n - i / 2] = b[i];
    }
    int bv = abs(outp[n - 1] - outp[0]);
    for(int i = 0; i < n - 1; i++) bv = max(bv, abs(outp[i + 1] - outp[i]));
    cout << bv << "\n";
    for(int i = 0; i < n - 1; i++) cout << outp[i] << " ";
    cout << outp[n - 1] << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...