Submission #472316

#TimeUsernameProblemLanguageResultExecution timeMemory
472316Ahmed57Cipele (COCI18_cipele)C++14
18 / 90
97 ms1868 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n,m; cin>>n>>m; vector<long long>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){ long long sum = 0; for(int i = 0;i<n;i++){ sum=max(sum,abs(arr[i]-aee[i])); } cout<<sum<<"\n"; }else if(n>m){ long long 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=max(ans,abs(arr[y]-aee[i])); y++; } cout<<ans<<"\n"; } 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...