Submission #472239

#	Time	Username	Problem	Language	Result	Execution time	Memory
472239		SaraMostafa	Cipele (COCI18_cipele)	C++14	27 / 90	1084 ms	1888 KiB

cipele

#include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ll long long
#define endl "\n"
#define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const long long mod=998244353;
const double PI=acos(-1);
int main()
{
    //freopen("input.in","r",stdin);
    Sara
// 2nd st
    int n,m;
    cin>>n>>m;
    vector<ll>a(n),b(m);
    for(int i=0; i<n; i++)
        cin>>a[i];
    for(int i=0; i<m; i++)
        cin>>b[i];
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    ll mx=0;
    if(n<m)
    {
        ll mn=1e9;
        for(int i=0; i<=(m-1)-(n-1); i++)
        {
            mx=0;
            int k=0;
            for(int j=i; j<i+n; j++)
            {
                mx=max(mx,abs(b[j]-a[k]));
               // cout<<b[j]<<' '<<a[k]<<endl;
                k++;
            }
            //cout<<mx<<endl;
            mn=min(mn,mx);
        }
        cout<<mn<<endl;
        return 0;
    }
    ll mn=1e9;
        for(int i=0; i<=(n-1)-(m-1); i++)
        {
            mx=0;
            int k=0;
            for(int j=i; j<i+m; j++)
            {
                mx=max(mx,abs(a[j]-b[k]));
                k++;
            }
            mn=min(mn,mx);
        }
        cout<<mn<<endl;
        return 0;
    }

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9