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 "wiring.h"
#include "bits/stdc++.h"
using namespace std;
long long min_total_length(std::vector<int> r, std::vector<int> b) {
if (r.size() > b.size()) {
swap(r, b);
}
int n = (int) r.size();
int m = (int) b.size();
auto dis = [&](int i, int j) {
return abs(i - j);
};
sort(r.begin(), r.end());
sort(b.begin(), b.end());
int p = 0;
long long ans = 0;
for (int i = 0; i < n; ++i) {
bool f = false;
while (p < m && (i == n - 1 || dis(r[i], b[p]) < dis(r[i + 1], b[p])) && m - p - 1 >= n - i - 1) {
ans += dis(r[i], b[p]);
f = true;
p++;
}
if (!f) {
ans += dis(r[i], b[p]);
p++;
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |