ABC110B - 1 Dimensional World's Tale

問題：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_element(vec_y.begin(), vec_y.end());
}

int main(void) {
    int n, m;
    
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> m;
    
    vector<int> vec_x(n + 1), vec_y(m + 1);
    cin >> vec_x[0] >> vec_y[0];
    REP(i, n) {
        cin >> vec_x[i + 1];
    }
    REP(i, m) {
        cin >> vec_y[i + 1];
    }
    
    cout << (isWar(vec_x, vec_y)? "War" : "No War") << "\n";
    return 0;
}