Submission #183397

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <map>
#include <sstream>
#include <queue>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <iterator>
#include <stack>
#include <list>
using namespace std;
typedef long long int lli;
typedef pair<int,int> P;
#define F first
#define S second
const int INF=1000000000;

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

Submission Info

Judge Result