Submission #1550257

---

Source Code Expand

#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <climits>
#include <bitset>
#include <functional>
#include <numeric>
#include <ctime>
#include <cassert>
#include <cstring>
#include <fstream>

#define rep(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#define irep(i, a, b) for(int (i)=(a);(i)<=(b);(i)++)
#define rrep(i, a, b) for(int (i)=(a);(i)>=(b);(i)--)

using namespace std;

const int MOD = 1e9 + 7;

int main() {
    vector<int> d(7), j(7);

    rep(i, 0, 7)
        cin >> d[i];
    rep(i, 0, 7)
        cin >> j[i];

    int maxx = 0;
    rep(i, 0, 7) {
        maxx += max(d[i], j[i]);
    }
    cout << maxx << endl;
    return 0;
}

Submission Info

Judge Result