Submission #1421096

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
const long long INF = 1e7 + 1;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
typedef long long int ll;
typedef vector<ll> vi;
typedef vector < pair<ll, ll > > vp;
typedef vector <string> vs;
typedef vector <char> vc;
typedef list <ll> lst;

ll n, m, k, ans = 0, sum = 0, cnt = 0;
string s;
char c;

#define Endl endl

/*--------------------template--------------------*/

ll a[105] = { 0 };
ll b[105] = { 0 };

int main()
{
	n = m = 7;
	vi va(n), vb(m);
	REP(i, n) cin >> va[i];
	REP(i, m) cin >> vb[i];
	REP(i, 7)
	{
		ans += max(va[i], vb[i]);
	}
	cout << ans << endl;
}

Submission Info

Judge Result