#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using pll = pair<ll, ll>;
const int N = 100010;
int m, n, q[N], a[N];
int main() {
  scanf("%d", &m);
  for (int i = 0; i < m; i++) scanf("%d", &q[i]);
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  int mn = *min_element(q, q + m) + 2;
  int ans = 0;
  for (int i = 0; i < n; i++) ans += a[i];
  sort(a, a + n);
  reverse(a, a + n);
  for (int i = mn - 2; i < n; i += mn) {
    ans -= a[i];
    if (i + 1 < n) ans -= a[i + 1];
  }
  printf("%d\n", ans);
}
