이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
void solve()
{
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n,m;
cin>>n>>m;
int arr[100000];
multiset<int>ms;
if(n<=m){
for(int i=0;i<n;i++){
cin>>arr[i];
}
for(int i=0;i<m;i++){
int x;
cin>>x;
ms.insert(x);
}
sort(arr,arr+n);
}
else{
for(int i=0;i<n;i++){
int x;
cin>>x;
ms.insert(x);
}
for(int i=0;i<m;i++){
cin>>arr[i];
}
sort(arr,arr+m);
}
int ans=0;
for(int i=0;i<min(n,m);i++){
int x = arr[i];
auto it1=ms.upper_bound(x);
auto it2=ms.upper_bound(x);
if(it1!=ms.begin()){
it1--;
}
if(it2!=ms.end()){
if(abs(x-*it1)<=abs(x-*it2)){
ans=max(ans,abs(x-*it1));
ms.erase(it1);
}
else{
ans=max(ans,abs(x-*it2));
ms.erase(it2);
}
}
else{
ans=max(ans,abs(x-*it1));
ms.erase(it1);
}
}
cout<<ans<<endl;
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... |