Submission #1811594

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()

using namespace std;

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

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int D[7] = {0};
	rep (i, 7) cin >> D[i];
	int J[7] = {0};
	rep (i, 7) cin >> J[i];

	int res = 0;
	for (int i = 0; i < 1<<7; ++i){
		int curr = 0;
		for (int j = 0; j < 7; ++j){
			if (i & (1<<j)){
				curr += J[j];
			}else{
				curr += D[j];
			} // end if
		} // end for
		res = max(res, curr);
	} // end for

	cout << res << endl; 

	return 0;
}

Submission Info

Judge Result