Submission #1280313

#TimeUsernameProblemLanguageResultExecution timeMemory
1280313tudor_costinCipele (COCI18_cipele)C++20
90 / 90
99 ms1972 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int Nmax=1e5+5,inf=1e17;
int a[Nmax],b[Nmax];
signed main()
{
    int n,m;
    cin>>n>>m;
    if(n>m)
    {
        swap(n,m);
        for(int i=1;i<=m;i++) cin>>b[i];
        for(int i=1;i<=n;i++) cin>>a[i];
    }
    else
    {
        for(int i=1;i<=n;i++) cin>>a[i];
        for(int i=1;i<=m;i++) cin>>b[i];
    }
    sort(a+1,a+n+1);
    sort(b+1,b+m+1);
    int l=0,r=inf;
    int ans=inf;
    while(l<=r)
    {
        int mid=(l+r)/2;
        int idx=1;
        bool ok=1;
        for(int i=1;i<=n;i++)
        {
            while(abs(a[i]-b[idx])>mid && idx<=m)
            {
                idx++;
            }
            if(idx==m+1) ok=0;
            idx++;
        }
        if(ok)
        {
            ans=mid;
            r=mid-1;
        }
        else l=mid+1;
    }
    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...