Submission #183261

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <sstream>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cctype>
#include <cassert>
#include <cstring>

using namespace std;

#define REP(i, x, n) for(int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back

typedef pair<int,int> P;
typedef long long int lli;

int main() {
  // ios_base::sync_with_stdio(false);
  int d[7], j[7];
  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