CF261A.Maxim and Discounts

Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.

There are m types of discounts. We assume that the discounts are indexed from 1 to m. To use the discount number i, the customer takes a special basket, where he puts exactly q__i items he buys. Under the terms of the discount system, in addition to the items in the cart the customer can receive at most two items from the supermarket for free. The number of the "free items" (0, 1 or 2) to give is selected by the customer. The only condition imposed on the selected "free items" is as follows: each of them mustn't be more expensive than the cheapest item out of the q__i items in the cart.

Maxim now needs to buy n items in the shop. Count the minimum sum of money that Maxim needs to buy them, if he use the discount system optimally well.

Please assume that the supermarket has enough carts for any actions. Maxim can use the same discount multiple times. Of course, Maxim can buy items without any discounts.

麦克斯姆总是在周日去超市购物。今天超市推出了一种特殊的折扣系统。

共有 $m$ 种折扣类型，我们假设这些折扣从 $1$ 编号至 $m$。要使用第 $i$ 种折扣，顾客需取一个特制购物篮，并将恰好 $q_i$ 件待购商品放入其中。根据该折扣规则，除篮中商品外，顾客最多还可从超市免费获得 2 件 商品（即免费商品数量可为 $0$、$1$ 或 $2$），具体数量由顾客自行选择。对所选免费商品的唯一限制是：每件免费商品的价格均不得超过篮中 $q_i$ 件商品里最便宜那件的价格。

目前麦克斯姆需要在超市购买 $n$ 件商品。若他能最优地利用该折扣系统，求他所需支付的最少金额。

请假设超市拥有足够多的购物篮以支持任意操作；麦克斯姆可多次使用同一种折扣；当然，他也可以选择不使用任何折扣直接购买商品。

The first line contains integer m (1 ≤ m ≤ 105) — the number of discount types. The second line contains m integers: _q_1, _q_2, ..., q__m (1 ≤ q__i ≤ 105).

The third line contains integer n (1 ≤ n ≤ 105) — the number of items Maxim needs. The fourth line contains n integers: _a_1, _a_2, ..., a__n (1 ≤ a__i ≤ 104) — the items' prices.

The numbers in the lines are separated by single spaces.

第一行包含一个整数 $m$（$1 \leq m \leq 10^5$）—— 折扣类型的数量。
第二行包含 $m$ 个整数：$q_1,\,q_2,\,\dots,\,q_m$（$1 \leq q_i \leq 10^5$）。

第三行包含一个整数 $n$（$1 \leq n \leq 10^5$）—— Maxim 所需物品的数量。
第四行包含 $n$ 个整数：$a_1,\,a_2,\,\dots,\,a_n$（$1 \leq a_i \leq 10^4$）—— 各物品的价格。

每行中的数字以单个空格分隔。

In a single line print a single integer — the answer to the problem.

在一行中输出一个整数——该问题的答案。

In the first sample Maxim needs to buy two items that cost 100 and get a discount for two free items that cost 50. In that case, Maxim is going to pay 200.

In the second sample the best strategy for Maxim is to buy 3 items and get 2 items for free using the discount. In that case, Maxim is going to pay 150.

在第一个样例中，马克西姆需要购买两件价格为 100 的商品，并获得两件价格为 50 的商品的免费折扣。此时，马克西姆需支付 200。

在第二个样例中，马克西姆的最优策略是购买 3 件商品，并利用折扣免费获得 2 件商品。此时，马克西姆需支付 150。