Submission #239871

#TimeUsernameProblemLanguageResultExecution timeMemory
239871MrRobot_28Vrtić (COCI18_vrtic)C++17
32 / 160
5 ms384 KiB
#include <bits/stdc++.h> using namespace std; signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; vector <int> p(n), c(n); for(int i = 0; i < n; i++) { cin >> p[i]; } for(int i = 0; i < n; i++) { cin >> c[i]; } sort(c.begin(), c.end()); vector <int> ans(n); int res = 0; int iter1 = n - 1, iter2 = 0; for(int i = c.size() - 1; i >= 0; i--) { if(i % 2 == 0) { ans[iter1] = c[i]; iter1--; } else { ans[iter2] = c[i]; iter2++; } } for(int i= 0; i < n; i++) { res = max(res, abs(ans[i]- ans[(i + 1) % n])); } cout << res << "\n"; for(int i= 0; i < n; i++) { cout << ans[i] << " "; } return 0; }
#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...