# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
723418 | rnl42 | Measures (CEOI22_measures) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
int N, M, D;
vector<int> A;
int ans = 0;
signed main() {
ios::sync_with_stdio(false), cout.tie(0), cin.tie(0);
cin >> N >> M >> D;
A.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int in;
for (int i = 0; i < M; i++) {
cin >> in;
A.push_back(in);
sort(A.begin(), A.end());
int truc = 0;
int cur = 0;
int mini = 0;
for (int i = (int)A.size()-2; i >= 0; i--) {
int deltamin = D+A[i]-A[i+1];
if (deltamin >= 0) {
cur = cur - deltamin;
} else {
cur = truc;
}
mini = min(cur, mini);
}
int ans = abs(mini);
cout << (ans>>1); if (ans & 1) cout << ".5";
cout << (i == M-1 ? '
' : ' ');
}
}