이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
using namespace std;
signed main(){
ios_base::sync_with_stdio();
cin.tie(0);
int n;
cin>>n;
set <int> st;
for(int i=0;i<n;i++){
int x;
cin>>x;
st.insert(x);
}
int q;
cin>>q;
while(q--){
int x;
cin>>x;
int ans=0;
int next=x;
bool flag=0;
auto it=st.lower_bound(x);
if(it!=st.end() && *it==x)flag=1;
if(!flag){
int mn=1e18;
int cur=x;
if(it!=st.begin()){
it--;
mn=min(mn,abs(cur-*it));
next=*it;
it++;
}
if(it!=st.end()){
if(abs(cur-*it)<mn){
mn=abs(cur-*it);
next=*it;
}
}
if(mn!=1e18)ans+=mn;
}
//cout<<ans<<" "<<next<<"\n";
while(!st.empty()){
//cout<<ans<<" "<<next<<"\n";
auto it=st.lower_bound(next);
int mn=1e18;
int cur=*it;
if(it!=st.begin()){
it--;
mn=min(mn,abs(cur-*it));
next=*it;
it++;
}
it++;
if(it!=st.end()){
if(abs(cur-*it)<mn){
mn=abs(cur-*it);
next=*it;
}
}
it--;
if(mn!=1e18)ans+=mn;
st.erase(it);
}
cout<<ans<<"\n";
}
}
# | 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... |