Submission #472345

#TimeUsernameProblemLanguageResultExecution timeMemory
472345Ahmed_SolymanCipele (COCI18_cipele)C++14
0 / 90
1100 ms8128 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n,m;cin>>n>>m; vector<ll>a,b; for(ll i=0;i<n;i++){ ll k;cin>>k; a.push_back(k); } for(ll i=0;i<m;i++){ ll k;cin>>k; b.push_back(k); } if(n>m)swap(a,b); map<ll,bool>vis; ll ans=0; for(ll i=0;i<n;i++){ ll mn=1e18; ll idx=0; for(ll j=0;j<m;j++){ if(vis[j])continue; ll y=abs(a[i]-b[j]); if(y<mn){ mn=y; idx=j; } } vis[idx]=1; ans=max(ans,mn); } cout<<ans<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...