#include <bits/stdc++.h>
using namespace std;
long long Set(long long N, long long pos) { return N = N | (1 << pos); }
long long reset(long long N, long long pos) { return N = N & ~(1 << pos); }
bool check(long long N, long long pos) { return (bool)(N & (1 << pos)); }
void CI(long long &_x) { scanf("%d", &_x); }
void CO(long long &_x) { cout << _x; }
template <typename T>
void getarray(T a[], long long n) {
  for (long long i = 0; i < n; i++) cin >> a[i];
}
template <typename T>
void prLLIarray(T a[], long long n) {
  for (long long i = 0; i < n - 1; i++) cout << a[i] << " ";
  cout << a[n - 1] << endl;
}
const double EPS = 1e-9;
const long long INF = 0x7f7f7f7f;
long long dr8[8] = {1, -1, 0, 0, 1, -1, -1, 1};
long long dc8[8] = {0, 0, -1, 1, 1, 1, -1, -1};
long long dr4[4] = {0, 0, 1, -1};
long long dc4[4] = {-1, 1, 0, 0};
long long kn8r[8] = {1, 2, 2, 1, -1, -2, -2, -1};
long long kn8c[8] = {2, 1, -1, -2, -2, -1, 1, 2};
int main() {
  int m, n;
  cin >> m;
  vector<int> V1, V2;
  for (long long i = 0; i < m; i++) {
    int temp;
    cin >> temp;
    V1.push_back(temp);
  }
  sort(V1.begin(), V1.end());
  cin >> n;
  for (long long i = 0; i < n; i++) {
    int temp;
    cin >> temp;
    V2.push_back(temp);
  }
  sort(V2.begin(), V2.end());
  long long ans = 0;
  while (V2.size()) {
    for (int i = 0; i < V1[0] && V2.size(); i++) {
      ans += V2[V2.size() - 1];
      V2.pop_back();
    }
    if (V2.size()) V2.pop_back();
    if (V2.size()) V2.pop_back();
  }
  cout << ans << "\n";
}
