# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
934684 | Isam | Cipele (COCI18_cipele) | 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.
#include<bits/stdc++.h>
using namespace std;
int N, M, L[100001], R[100001];
signed main(){
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> N >> M;
for(register int i = 1; i <= N; ++i){
cin >> L[i];
}
for(register int i = 1; i <= M; ++i){
cin >> R[i];
}
sort(L+1, L+N+1), sort(R+1, R+M+1);
long long ans(0);
// int l(1);
// while(L[l+1] < R[l] && l < N && l + M)
for(register int i = 1; i <= N; ++i){
ans += abs(L[i] - R[i])
}
cout << ans << '\n';
return 0;
}