Submission #1105115

#TimeUsernameProblemLanguageResultExecution timeMemory
1105115toast12Just Long Neckties (JOI20_ho_t1)C++14
0 / 100
1 ms336 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { ios_base::sync_with_stdio(0); cin.tie(NULL); int n; cin >> n; vector<int> a(n+1), b(n); for (int i = 0; i <= n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; sort(a.begin(), a.end()); sort(b.begin(), b.end()); vector<int> c(n+1); multiset<int> diff; for (int i = 0; i < n; i++) diff.insert(abs(a[i+1]-b[i])); c[0] = *diff.rbegin(); for (int i = 0; i < n; i++) { diff.erase(diff.find({a[i+1]-b[i]})); diff.insert(abs(a[i]-b[i])); c[i+1] = *diff.rbegin(); } 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...