【BZOJ4868】【SHOI2017】期末考试

【题目链接】

• 点击打开链接
  

【思路要点】

• 枚举工作结束的时间，根据A和B的大小关系计算该时间的最小代价。
• 时间复杂度\(O(NLogN+MLogM+Ti)\)。

【代码】

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); } 
template <typename T> void read(T &x) {
	x = 0; int f = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
template <typename T> void write(T x) {
	if (x < 0) x = -x, putchar('-');
	if (x > 9) write(x / 10);
	putchar(x % 10 + '0');
}
template <typename T> void writeln(T x) {
	write(x);
	puts("");
}
int n, m;
long long A, B, C, a[MAXN], b[MAXN], sum[MAXN];
int main() {
	read(A), read(B), read(C);
	read(n), read(m);
	for (int i = 1; i <= n; i++)
		read(a[i]);
	for (int i = 1; i <= m; i++)
		read(b[i]);
	sort(a + 1, a + n + 1);
	sort(b + 1, b + m + 1);
	for (int i = 1; i <= m; i++)
		sum[i] = sum[i - 1] + b[i];
	int pos = 0, pre = 0;
	long long now = 0, ans = 1e18;
	for (int i = 0; i <= 1e5; i++) {
		while (pos + 1 <= n && i > a[pos + 1]) pos++;
		while (pre + 1 <= m && i > b[pre + 1]) pre++;
		if (C >= 1e16 && pos != 0) break;
		now += C * pos; if (now >= ans) break;
		long long lft = 1ll * i * pre - sum[pre];
		long long gal = sum[m] - sum[pre] - 1ll * i * (m - pre);
		long long tmp = now;
		if (A < B) {
			tmp += A * min(lft, gal);
			gal -= min(lft, gal);
			tmp += B * gal;
		} else tmp += B * gal;
		chkmin(ans, tmp);
	}
	writeln(ans);
	return 0;
}