Submission #1818802

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) FOR(i,0,n)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define PQ priority_queue
#define UM unordered_map
#define US unordered_set
#define ALL(a) (a).begin(),(a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pii;
typedef vector<pii> vpii;
const ll INF = (1ll << 60);
const ll MOD=1000000007;

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

Submission Info

Judge Result