This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n , m;
cin >> n >> m;
vector<int> a(n) , b(m);
for(int i = 0 ;i < n ; i ++)
cin >> a[i];
for(int i = 0 ; i < m ; i ++)
cin >> b[i];
if(n > m)swap(a , b) , swap(n , m);
long long mn = 0 ;
sort(a.begin() , a.end());
sort(b.begin() , b.end());
for(int i = 0 ; i < n ; i ++)
mn = max(mn , 1ll * abs(a[i] - b[i]));
cout << mn ;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |