Submission #1260410

#TimeUsernameProblemLanguageResultExecution timeMemory
1260410kawhietJust Long Neckties (JOI20_ho_t1)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); 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]; } multiset<int> s; for (int i = 0; i < n; i++) { s.insert(max(a[i + 1] - b[i], 0)); } cout << *s.rbegin() << ' '; for (int i = 0; i < n; i++) { s.erase(s.find(max(a[i + 1] - b[i], 0))); s.insert(max(a[i] - b[i], 0)); cout << *s.rbegin() << ' '; } cout << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...