Submission #1105112

#TimeUsernameProblemLanguageResultExecution timeMemory
1105112toast12Just Long Neckties (JOI20_ho_t1)C++14
0 / 100
1 ms336 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); int n; cin >> n; vector<int> a(n+1), b(n); multiset<int> s; for (int i = 0; i <= n; i++) { cin >> a[i]; s.insert(a[i]); } for (int i = 0; i < n; i++) cin >> b[i]; sort(b.begin(), b.end()); vector<int> c(n+1); multiset<int> diff; auto it = s.begin(); ++it; for (int i = 0; i < n; i++) { diff.insert(abs(*it-b[i])); ++it; } c[0] = *diff.rbegin(); it = s.begin(); int x = *it; ++it; for (int i = 0; i < n; i++) { diff.erase(diff.find({*it-b[i]})); diff.insert(abs(x-b[i])); c[i+1] = *diff.rbegin(); x = *it; ++it; } for (int i = 0; i <= n; i++) cout << c[i] << ' '; cout << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...