mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2025-02-17 13:46:48 +00:00
P7514 [省选联考 2021 A/B 卷] 卡牌游戏
R65969728
This commit is contained in:
parent
fcadb28e33
commit
fc158b5ece
28
Luogu/P7514/P7514.cpp
Normal file
28
Luogu/P7514/P7514.cpp
Normal file
@ -0,0 +1,28 @@
|
|||||||
|
#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;
|
||||||
|
}
|
Loading…
x
Reference in New Issue
Block a user