Problem B

本能~ 
还以为是复杂的DP,  不是表面那么简单~,这么多人过,  这题真的吓到我了~~！ 靠人类的本能"贪心~"就能想到怎么最优, 囧~~~

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <algorithm>
//#include "myAlgorithm.h"

#define MAX 100005
#define INF (1e8 + 5)
#define eps 1e-30
#define Rep(s, e) for( int i = s; i <= e; i++)
#define Cep(e, s) for( int i = e; i >= s; i --)
using namespace std;
int m, q[MAX], n, a[MAX];
void solve(){
    int bag = q[1];
    int ans = 0;
    Cep(n, 1){
        if(bag){
            ans += a[i];
            bag --;
        }else {
            i -= 1;
            bag = q[1];
        }
    }
    cout<<ans<<endl;
}
int main()
 {
    //freopen("in.txt", "w", stdout);
    while(cin>>m){
        Rep(1, m)cin>>q[i];
        cin>>n;
        Rep(1, n)cin>>a[i];
        sort(q + 1, q + 1 + m);
        sort(a+ 1, a + 1 + n);
        solve();
    }
    return 0;
}
/*

*/