1535번

1535

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n;
int answer = 0;
vector<int> L;
vector<int> J;

void dfs(int index, int sumL, int sumJ) {
	if (index == n) {
		answer = max(answer, sumJ);
		return;
	}
	if (sumL + L[index] < 100) {
		dfs(index + 1, sumL + L[index], sumJ + J[index]);
	}
	dfs(index + 1, sumL, sumJ);
}

int main() {

	cin >> n;

	for (int i = 0; i < n; i++) {
		int inputL;
		cin >> inputL;
		L.push_back(inputL);
	}

	for (int i = 0; i < n; i++) {
		int inputJ;
		cin >> inputJ;
		J.push_back(inputJ);
	}

	dfs(0, 0, 0);
	cout << answer;
}