Submission #207023

#TimeUsernameProblemLanguageResultExecution timeMemory
207023SaboonJust Long Neckties (JOI20_ho_t1)C++14
100 / 100
382 ms14816 KiB
#include <bits/stdc++.h> using namespace std; typedef pair <int, int> pii; const int maxn = 2e5 + 2; int ans[maxn], b[maxn]; pii a[maxn]; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; for (int i = 0; i <= n; i++) { cin >> a[i].first; a[i].second = i; } sort(a, a + n + 1); for (int i = 0; i < n; i++) { cin >> b[i]; } sort(b, b + n); multiset <int> S; for (int i = 1; i <= n; i++) { S.insert(a[i].first - b[i - 1]); // cout << a[i].first << ' ' << b[i - 1] << endl; } ans[a[0].second] = *S.rbegin(); for (int i = 1; i <= n; i++) { S.erase(S.find(a[i].first - b[i - 1])); S.insert(a[i - 1].first - b[i - 1]); ans[a[i].second] = *S.rbegin(); } for (int i = 0; i <= n; i++) cout << ans[i] << ' '; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...