您的位置:首页 > 其它

Vasya and Public Transport

2013-10-14 19:42 183 查看
http://codeforces.com/contest/355/problem/B

// File Name: cf_b.cpp
// Author: bo_jwolf
// Created Time: 2013年10月14日 星期一 19:37:15

#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>

using namespace std;

int main(){
int n, m, c1, c2, c3, c4, temp, sum_bus = 0, sum_troll = 0;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for( int i = 0; i < n; ++i ){
cin >> temp;
sum_bus += min( c2, c1 * temp );
}
for( int i = 0; i < m; ++i ){
cin >> temp;
sum_troll += min( c2, c1 * temp );
}
printf( "%d\n", min( c4, min( c3, sum_bus ) + min( c3, sum_troll ) ) );
return 0;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  Codeforces206 Div. 2