Submission #240520

#TimeUsernameProblemLanguageResultExecution timeMemory
240520DavidDamianCipele (COCI18_cipele)C++11
27 / 90
50 ms3192 KiB
#include <bits/stdc++.h>
using namespace std;
int n,m;
vector<int> A;
vector<int> B;
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        int x;
        cin>>x;
        A.push_back(x);
    }
    for(int i=1;i<=m;i++){
        int x;
        cin>>x;
        B.push_back(x);
    }
    sort(A.begin(),A.end());
    sort(B.begin(),B.end());
    int maximum=0;
    for(int i=0;i<n;i++){
        maximum=max(maximum,abs(A[i]-B[i]));
    }
    cout<<maximum<<'\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...