#include <bits/stdc++.h>
#define ll long long
#define sz(x) int(x.size())
#define forn(i,n) for(i=0; i<n; i++)
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define fr first
#define se second
using namespace std;
long long min_total_length(std::vector<int> r, std::vector<int> b) {
vector<ll>a,v;
for(auto k:r)
a.pb(k);
for(auto k:b)
v.pb(k);
if(sz(a)<sz(v))
swap(a,v);
ll i, tot=0, j, mi;
for(i=0; i<sz(a); i++)
{
mi=LLONG_MAX;
for(j=0; j<sz(v); j++)
mi=min(abs(v[j]-a[i]),mi);
tot=tot+mi;
}
return tot;
}
# | 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... |