제출 #1108284

#제출 시각아이디문제언어결과실행 시간메모리
1108284overwatch9Just Long Neckties (JOI20_ho_t1)C++17
0 / 100
1 ms336 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector <int> a(n+1), b(n); for (int i = 0; i < n+1; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; sort(b.begin(), b.end()); vector <int> a2 = a; sort(a2.begin(), a2.end()); multiset <int> d; for (int i = 1; i < n+1; i++) { d.insert(max(0, a2[i] - b[i-1])); } cout << *d.rbegin() << ' '; for (int i = 0; i < n; i++) { d.insert(max(0, a2[i] - b[i])); d.erase(d.find(max(0, a2[i+1] - b[i]))); cout << *d.rbegin() << ' '; } cout << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...