#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;} template inline string toString(T x) {ostringstream sout;sout< VI; typedef vector VVI; typedef vector VS; typedef pair PII; typedef long long LL; typedef unsigned long long ULL; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define MP make_pair #define SZ(a) int((a).size()) #define EACH(i,c) for(auto i: c) #define SORT(c) sort((c).begin(),(c).end()) #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() const double EPS = 1e-10; const double PI = acos(-1.0); #define dump(x) cerr << #x << " = " << (x) << endl; #define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; int main() { cin.tie(0); ios::sync_with_stdio(false); const int ini = 1000000; int N, M, sumA = 0; cin >> N; VI A(N); REP(i, N){ cin >> A[i]; sumA += A[i]; } cin >> M; VI B(M); REP(i, M) cin >> B[i]; sort(ALL(B), greater()); int maxRet = ini; REP(i, M){ sumA -= B[i]; if(sumA < 0){ maxRet = i + 1; break; } } VI a(N, 0), b(M, 0); int ret = ini, cnt = 0; function f = [&](int n){ if(ret == maxRet) return; if(n >= N){ int num = 0; for(auto i: b) if(i != 0) num++; ret = min(ret, num); //cout << cnt++ << endl; } else{ REP(i, M){ b[i] += A[n]; if(b[i] > B[i]){ b[i] -= A[n]; continue; } f(n + 1); b[i] -= A[n]; } } }; f(0); if(ret == ini) ret = -1; cout << ret << endl; return 0; }