제출 #1108239

#제출 시각아이디문제언어결과실행 시간메모리
1108239overwatch9Just Long Neckties (JOI20_ho_t1)C++17
9 / 100
1043 ms6216 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()); for (int i = 0; i < n+1; i++) { int mx = 0; bool skipped = false; for (int j = 0, id = 0; j < n+1; j++) { if (!skipped && a[i] == a2[j]) { skipped = true; continue; } mx = max(mx, a2[j] - b[id]); id++; } cout << mx << ' '; } cout << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...