Submission #183306

---

Source Code Expand

#include <iostream>
#include <string>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <functional>
#include <map>
#include <set>

using namespace std;

typedef long long i64;
typedef int int_t;
typedef vector<int_t> vi;
typedef vector<vi> vvi;

typedef pair<int_t, int_t> pi;

#define tr(c, i) for(typeof((c).begin()) i = (c).begin(); i < (c).end(); i++)
#define pb push_back
#define sz(a) int((a).size())
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)

int main(int argc, char *argv[]) {
  vi D(7), J(7);
  int i;
  REP(0, 7, i) {
    cin >> D[i];
  }
  REP(0, 7, i) {
    cin >> J[i];
  }
  int ans = 0;
  REP(0, 7, i) {
    ans += max(D[i], J[i]);
  }
  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result