Submission #1105120

#TimeUsernameProblemLanguageResultExecution timeMemory
1105120toast12Just Long Neckties (JOI20_ho_t1)C++14
100 / 100
214 ms18576 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); int n; cin >> n; vector<pair<int, int>> a(n+1); vector<int> b(n+1); for (int i = 0; i <= n; i++) { cin >> a[i].first; a[i].second = i; } for (int i = 1; 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 = 1; i <= n; i++) diff.insert(a[i].first-b[i]); c[a[0].second] = *diff.rbegin(); for (int i = 1; i <= n; i++) { diff.erase(diff.find({a[i].first-b[i]})); diff.insert(a[i-1].first-b[i]); c[a[i].second] = *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...