| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 157094 | AKaan37 | 전선 연결 (IOI17_wiring) | C++17 | 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.
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
//~ #include "wiring.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 100000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
lo n,m,b[li],a[li],k,flag,t,mx,mn=inf;
lo cev;
queue<lo> q,q1;
string s;
vector<PII> v;
long long min_total_length(std::vector<int> r, std::vector<int> b) {
for(lo i=0;i<(lo)r.size();i++){v.pb(mp(r[i],1));}
for(lo i=0;i<(lo)b.size();i++){v.pb(mp(b[i],2));}
sort(v.begin(),v.end());
for(int i=0;i<(int)v.size();i++){
if(v[i].se==1){
if(q1.size()){
cev+=abs(v[i].fi-q1.front());
mx=max(mx,q1.front());
q1.pop();
}
else q.push(v[i].fi);
}
else{
mn=inf;
if(q.size()){
cev+=abs(v[i].fi-q.front());
mx=max(mx,q.front());
q.pop();
}
else{
q1.push(v[i].fi);
}
}
}
//~ cout<<cev<<endl;
while(q.size()){
mn=inf;
for(lo i=0;i<(lo)b.size();i++){mn=min(mn,abs(b[i]-q.front()));}
q.pop();
cev+=mn;
}
while(q1.size()){
mn=inf;
for(lo i=0;i<(lo)b.size();i++){mn=min(mn,abs(b[i]-q1.front()));}
q1.pop();
cev+=mn;
}
return cev;
}
int main() {
int n, m;
assert(2 == scanf("%d %d", &n, &m));
vector<int> r(n), b(m);
for(int i = 0; i < n; i++)
assert(1 == scanf("%d", &r[i]));
for(int i = 0; i < m; i++)
assert(1 == scanf("%d", &b[i]));
long long res = min_total_length(r, b);
printf("%lld\n", res);
return 0;
}