洛谷P3745 [六省联考 2017] 期末考试

 

#include<bits/stdc++.h>
#define ll long long
#define mod (ll) 1000000007
 
 
using namespace std;  
   
const int MAX_N = 100010; 
const int MAX_M = 100010;
int n,m;
ll A,B,C;
int t[MAX_N];
int b[MAX_N];

ll sum_te(int p){
	ll x,y;
	x = y = 0;
	for(int i=0;i<m;i++){
		if(b[i] > p) x += b[i] - p;
		else y += p - b[i];
	}
	if(A < B) return min(x,y) * A + (x - min(x,y)) * B;
	else return x*B;
	
}

ll sum_stu(int p){
	ll sum = 0;
	for(int i=0;i<n;i++){
		if( p > t[i]) sum += p - t[i];
	}
	return sum * C;
}

int main() {
	cin >> A >> B >> C;
	cin >> n >> m;
	for(int i=0;i<n;i++) cin >> t[i];
	for(int i=0;i<m;i++) cin >> b[i];
	sort(t,t+n);
	sort(b,b+m);
	if(C == 1e16){
		cout << sum_te(t[0]) << endl;
		return 0;
	}
//	if(A == 1e9 && B == 1e9){
//		ll sum = 0;
//		for(int i=0;i<n;i++){
//			for(int j=0;j<m;j++){
//				if(b[j] > t[i])
//				sum+=C*(b[j] - t[i]);
//			}
//		}
//		cout << sum << endl;
//		return 0;
//	}
	int l = 1;
	int r = 1e5 +10;
	while( r - l > 2){
		int mid1 = l + (r - l)/3;
		int mid2 = r - (r - l)/3;
		ll sum1 = sum_te(mid1) + sum_stu(mid1);
		ll sum2 = sum_te(mid2) + sum_stu(mid2);
		if(sum1 < sum2) r = mid2;
		else l = mid1;
	} 
	ll ans = 1e18;
	for(int i=l;i<=r;i++){
		ll sum = sum_te(i) + sum_stu(i);
		ans = min(ans,sum);
	}
	cout << ans << endl;
	
    return 0;  
}