이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
vector<int>arr(n),aee(m);
for(int i =0;i<n;i++){
cin>>arr[i];
}
for(int i = 0;i<m;i++){
cin>>aee[i];
}
sort(arr.begin(),arr.end());sort(aee.begin(),aee.end());
if(m>n){swap(arr,aee);swap(n,m);}
if(n==m){
int sum = 0;
for(int i = 0;i<n;i++){
sum+=abs(arr[i]-aee[i]);
}
cout<<sum<<"\n";
}else if(n>m){
int ans = 0;
int y = 0;
for(int i = 0;i<m;i++){
for(;y<(n-m)+i;y++){
if(y<(((n-m)+i)-1)&&abs(arr[y]-aee[i])<=abs(arr[y+1]-aee[i]))break;
}
ans+=abs(arr[y]-aee[i]);
}
cout<<ans<<"\n";
}
return 0;
}
# | 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... |
# | 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... |