Submission #1328681

#TimeUsernameProblemLanguageResultExecution timeMemory
1328681benjaminshihCipele (COCI18_cipele)C++20
18 / 90
68 ms1208 KiB
#include <bits/stdc++.h>
using namespace std;
int main(){
    int n,m;
    cin >> n >> m;
    vector<int> l(n);
    vector<int> r(m);
    for(auto &x : l) cin >> x;
    for(auto &x : r) cin >> x;
    int mx = 0;
    sort(l.begin(),l.end());
    sort(r.begin(),r.end());
    if(n == m){
        for(int i = 0 ; i < n ; i ++){
            mx = max(mx,abs(l[i]-r[i]));
        }
        cout << mx;
    }
}
#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...