Submission #83371

#	Time	Username	Problem	Language	Result	Execution time	Memory
83371		charlies_moo	Cipele (COCI18_cipele)	C++98	0 / 90	1083 ms	4180 KiB

cipele

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<stack>
#include<queue>
#include<cctype>
#include<sstream>
using namespace std;
typedef long long l;
l n,m;
l leftt[99999];
l rightt[99999];
l ans=-1;
int main(void)
{
    cin >> n >> m;
    for(int i=0;i<n;i++) cin >> leftt[i];
    for(int i=0;i<m;i++) cin >> rightt[i];
    sort(leftt,leftt+n);
    sort(rightt,rightt+m);
    for(l i=0;i<n;i++)
    {
        l temp=99999;
        for(l j=0;j<m;j++)
        {
            if((abs(leftt[i]-rightt[j]))<temp) temp=abs(leftt[i]-rightt[j]);
        }
        ans=temp;
    }
    cout << ans << endl;
    return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 9
• Subtask 3: 0 / 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