| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 472288 | Mr_Ph | Cipele (COCI18_cipele) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
///made by : Mr_Ph :D
#include<bits/stdc++.h>
#include<unordered_map>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
const double PI=acos(-1.0);
const ll mod=(ll)1e9+7;
//int a1[4] = {0, 0, 1, -1};
//int b1[4] = {1, -1, 0, 0};
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define lower(s) transform(s.begin(),s.end(),s.begin(),::tolower)
#define upper(s) transform(s.begin(),s.end(),s.begin(),::toupper)
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
///the end of the defines ;)
void solve()
{
int n,m;
cin>>n>>m;
deque<int>arr(n);
deque<int>brr(m);
ent(arr);
ent(brr);
map<int,int>mp;
sort(all(arr));
sort(all(brr));
int mxdiff=0,ans=0;
if(n==m)
{
for(int i=0;i<n;i++)
mxdiff=max(abs(arr[i]-brr[i]));
cout<<mxdiff<<endl;
}
else if(n>m)
{
for(int i=0; i<m; i++)
{
int mndiff=INT_MAX;
for(int k=i; k<n; k++)
if(!mp[k])
mndiff=min(mndiff,abs(brr[i]-arr[k]));
for(int k=i; k<n; k++)
{
if(abs(arr[k]-brr[i])==mndiff&&!mp[k])
{
mp[k]++;
break;
}
}
ans=max(ans,mndiff);
}
}
else
{
for(int i=0; i<n; i++)
{
int mndiff=INT_MAX;
for(int k=i; k<m; k++)
if(!mp[k])
mndiff=min(mndiff,abs(arr[i]-brr[k]));
for(int k=i; k<n; k++)
{
if(abs(brr[k]-arr[i])==mndiff&&!mp[k])
{
mp[k]++;
break;
}
}
ans=max(ans,mndiff);
}
}
cout<<ans<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
//freopen("window.in","r",stdin);
//freopen("output.txt","w",stdout);
int t=1;//int st;
//cin>>t;//cin>>st;
while(t--)
solve();
}