0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-25 07:31:59 +00:00
OI-codes/LibreOJ/3499/3499.cpp

29 lines
577 B
C++

#include <iostream>
#include <limits>
using std::cin;
using std::cout;
using std::endl;
const int N = 1000005;
int n, m, a[N], b[N];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
int min = std::numeric_limits<int>::max(),
max = std::numeric_limits<int>::min();
for (int i = 1; i <= n; i++) {
min = std::min(min, std::max(a[i], b[i]));
max = std::max(max, std::min(a[i], b[i]));
}
cout << max - min << endl;
return 0;
}