Atcoder 灵异事件

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6;
int n, m, a [N + 5], b [N + 5], c [N + 5], dsum [N + 5];
void Turn () {
	cin >> n >> m;
	for (int i = 1 ; i <= n ; i ++) {
		cin >> a [i];
	} sort (a + 1, a + n + 1);
	
	for (int i = 1 ; i <= m ; i ++) {
		cin >> b [i];
	}
	
	int sumc = 0;
	for (int i = 1 ; i <= m ; i ++) {
		cin >> c [i]; sumc += c [i];
	}
	
	int ans = 1e18, suma = 0, sum = 0;
	for (int j = 1 ; j <= m ; j ++) {
		int t = (b [j] * n - c [j] + b [j] - 1) / b [j];
		if (t < 0) t = 0;
		dsum [t] -= -b [j] * n + c [j] + t * b [j];
		dsum [t + 1] += -b [j] * n + c [j] + t * b [j];
		dsum [t + 1] -= b [j];
	}
	for (int i = 0 ; i <= n ; i ++) {
		if (i > 0) dsum [i] += dsum [i - 1]; 
		sum += dsum [i];
		suma += a [i];
		ans = min (ans, sumc + suma + sum);
	}
	
	cout << ans;
}

int _; void Init () {
//	ios :: sync_with_stdio (0); cin. tie (0); cout. tie (0);
	_ = 1;
//	freopen (".in", "r", stdin);
//	freopen (".out", "w", stdout);
//	cin >> _;
}

	signed main () { Init ();
	while (_ --> 0)
	Turn (); return 0; }