Submission #1903472

---

Source Code Expand

#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <numeric>
#include <functional>
#include <iostream>
#include <string>
#include <array>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <bitset>
typedef long long ll;
typedef unsigned long long ull;

# define INF 0x3f3f3f3f

#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define DEBUG(vec) for (auto v : vec) { cout << v << " "; } cout << endl;

using namespace std;

int D[7] = {};
int J[7] = {};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  REP(i, 7) {
    cin >> D[i];
  }
  REP(i, 7) {
    cin >> J[i];
  }
  int ans = 0;
  REP(i, 7) {
    ans += max(D[i], J[i]);
  }

  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result