問題：B - 1 Dimensional World's Tale #include <algorithm> #include <iostream> #include <vector> using namespace std; #define REP(i, n) for (int i = 0; i < (n); ++i) bool isWar(vector<int> vec_x, vector<int> vec_y) { return *max_element(vec_x.begin(), vec_x.end()) >= *min_elemen</int></int></vector></iostream></algorithm>…