Submission #1113967

#TimeUsernameProblemLanguageResultExecution timeMemory
1113967sunboiJust Long Neckties (JOI20_ho_t1)C++17
100 / 100
168 ms12360 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { int n; cin >> n; vector<pair<int, int>> a(n + 1); vector<int> b(n), ans(n + 1); for (int i = 0; i <= n; i++){ cin >> a[i].first; a[i].second = i; } for (int i = 0; i < n; i++){ cin >> b[i]; } sort(a.begin(), a.end()); sort(b.begin(), b.end()); int disgust = 0; for (int i = 0; i < n; i++){ disgust = max(disgust, a[i].first - b[i]); } ans[a[n].second] = disgust; for (int i = n - 1; i >= 0; i--){ disgust = max(disgust, a[i + 1].first - b[i]); ans[a[i].second] = disgust; } for (int i = 0; i <= n; i++){ cout << ans[i] << ' '; } cout << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...