text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4, n, m, p, q;
int main() {
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
vector<int> a(n), b(m);
for (int i = 0; i < (int)n; ++i) {
cin >> a[i];
a[i] = min(a[i] * c1, c2);
}
for (int i = 0; i < (int)m; ++i) {
cin >> b[i];
b[i] = min(b[i] * c1, c2);
}
p = accumulate(begin(a), end(a), 0);
q = accumulate(begin(b), end(b), 0);
vector<int> d{c4, c3 * 2, p + q, p + c3, c3 + q};
cout << *min_element(begin(d), end(d)) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
int n, m;
int a[1002], b[1002];
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++) cin >> b[i];
for (int i = 1; i <= n; i++) {
if (c2 < c1 * a[i])
a[i] = c2;
else
a[i] = c1 * a[i];
}
for (int i = 1; i <= m; i++) {
if (c2 < b[i] * c1)
b[i] = c2;
else
b[i] = c1 * b[i];
}
int sum1 = 0;
int sum2 = 0;
for (int i = 1; i <= n; i++) sum1 += a[i];
if (sum1 > c3) sum1 = c3;
for (int i = 1; i <= m; i++) sum2 += b[i];
if (sum2 > c3) sum2 = c3;
int sum3 = sum1 + sum2;
if (sum3 > c4) sum3 = c4;
cout << sum3 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << fixed;
cout << setprecision(10);
int a, b, c, d;
cin >> a >> b >> c >> d;
int n, m;
cin >> n >> m;
int bus = 0, trolley = 0, num;
for (int i = 1; i <= n; i++) {
cin >> num;
bus += min(num * a, b);
}
for (int i = 1; i <= m; i++) {
cin >> num;
trolley += min(num * a, b);
}
cout << min(min(bus, c) + min(trolley, c), d);
}
|
#include <bits/stdc++.h>
using namespace std;
long long po(long long n, long long exp) {
long long prod = 1;
for (long long i = 0; i < exp; i++) prod = (prod * n);
return prod;
}
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
signed main() {
ios_base::sync_with_stdio(false);
long long TESTS = 1;
while (TESTS--) {
long long c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
long long n, m;
cin >> n >> m;
long long a[n], b[m];
long long sum1 = 0, sum2 = 0;
for (long long i = 0; i < n; i++) {
cin >> a[i];
sum1 += a[i];
}
for (long long i = 0; i < m; i++) {
cin >> b[i];
sum2 += b[i];
}
long long cost1 = c1 * (sum1), cost2 = c1 * (sum2);
for (long long i = 0; i < n; i++) {
if (a[i] * c1 > c2) {
cost1 -= a[i] * c1 - c2;
}
}
for (long long i = 0; i < m; i++) {
if (b[i] * c1 > c2) {
cost2 -= b[i] * c1 - c2;
}
}
if (cost1 > c3) cost1 = c3;
if (cost2 > c3) cost2 = c3;
long long cost = cost1 + cost2;
if (cost > c4) cost = c4;
cout << cost;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int a[N], b[N];
int main() {
int c1, c2, c3, c4;
int n, m, i;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
int ans = min(c4, c3 * 2), mina = 0;
for (i = 1; i <= n; i++) {
cin >> a[i];
mina += min(c1 * a[i], c2);
}
ans = min(ans, c3 + mina);
int minb = 0;
for (i = 1; i <= m; i++) {
cin >> b[i];
minb += min(c1 * b[i], c2);
}
ans = min(ans, c3 + minb);
ans = min(ans, mina + minb);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, n, m;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
int temp1, temp2, temp3, val;
temp1 = 0;
while (n > 0) {
cin >> val;
if (val * c1 < c2)
temp1 += val * c1;
else
temp1 += c2;
n--;
}
if (temp1 > c3) temp1 = c3;
temp2 = 0;
while (m > 0) {
cin >> val;
if (val * c1 < c2)
temp2 += val * c1;
else
temp2 += c2;
m--;
}
if (temp2 > c3) temp2 = c3;
if (temp1 + temp2 > c4)
cout << c4 << endl;
else
cout << temp1 + temp2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
int b[n], t[m];
for (int i = 0; i < n; ++i) cin >> b[i];
for (int i = 0; i < m; ++i) cin >> t[i];
int b1, sumb1;
b1 = 0;
for (int i = 0; i < n; ++i) b1 += min(b[i] * c1, c2);
sumb1 = min(b1, c3);
int t1, sumt1;
t1 = 0;
for (int i = 0; i < m; ++i) t1 += min(t[i] * c1, c2);
sumt1 = min(t1, c3);
int ans = min(sumb1 + sumt1, c4);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long int c1, c2, c3, c4, n, m, i, a = 0, t = 0, tmp;
int main() {
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
for (i = 0; i < n; ++i) {
cin >> tmp;
if (tmp <= (c2 / c1))
a += tmp * c1;
else
a += c2;
}
if (a > c3) a = c3;
for (i = 0; i < m; ++i) {
cin >> tmp;
if (tmp <= (c2 / c1))
t += tmp * c1;
else
t += c2;
}
a += min(c3, t);
cout << min(c4, a);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
scanf("%d%d%d%d", &c1, &c2, &c3, &c4);
int n, m;
scanf("%d%d", &n, &m);
int buses[n], trolleys[m];
for (int i = 0; i < n; i++) scanf("%d", buses + i);
for (int i = 0; i < m; i++) scanf("%d", trolleys + i);
int minOnBuses = 0, minOnTrolleys = 0;
for (int i = 0; i < n; i++) minOnBuses += min(c2, c1 * buses[i]);
for (int i = 0; i < m; i++) minOnTrolleys += min(c2, c1 * trolleys[i]);
minOnBuses = min(minOnBuses, c3);
minOnTrolleys = min(minOnTrolleys, c3);
printf("%d\n", min(minOnBuses + minOnTrolleys, c4));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long c1, c2, c3, c4, n, m, b[1005], t[1005], ans;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (long long i = 0; i < n; i++) cin >> b[i];
for (long long i = 0; i < m; i++) cin >> t[i];
long long temp1 = 0, temp2 = 0;
for (long long i = 0; i < n; i++) temp1 += min(b[i] * c1, c2);
temp1 = min(temp1, c3);
for (long long i = 0; i < m; i++) temp2 += min(t[i] * c1, c2);
temp2 = min(temp2, c3);
ans = min(c4, temp1 + temp2);
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int LRG = (int)1e9;
int c1, c2, c3, c4;
int n, m;
int minb = 0;
int mint = 0;
int mina = 0;
int main() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
minb += min(a * c1, c2);
}
minb = min(minb, c3);
for (int i = 0; i < m; i++) {
int b;
cin >> b;
mint += min(b * c1, c2);
}
mint = min(mint, c3);
mina = minb + mint;
mina = min(mina, c4);
cout << mina;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, min2, min3, mina = 0, minb = 0;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
int arr1[n];
for (int i = 0; i < n; ++i) {
cin >> arr1[i];
}
int arr2[m];
for (int i = 0; i < m; ++i) {
cin >> arr2[i];
}
min2 = c3 * 2, min3 = c4;
int final = 0;
for (int i = 0; i < n; ++i) {
int ad = min(arr1[i] * c1, c2);
mina += ad;
}
final += min(c3, mina);
for (int i = 0; i < m; ++i) {
int ad = min(arr2[i] * c1, c2);
minb += ad;
}
final += min(minb, c3);
int x = min(final, min2);
int ultimate = min(x, min3);
cout << ultimate << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long int c1, c2, c3, c4, n, m, a[2000], b[2000], i, j;
long int cur, sum1, sum2;
int main() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (i = 1; i <= n; i++) cin >> a[i];
for (i = 1; i <= m; i++) cin >> b[i];
for (i = 1; i <= n; i++) {
cur = a[i] * c1;
sum1 += min(cur, c2);
}
sum1 = min(sum1, c3);
for (i = 1; i <= m; i++) {
cur = b[i] * c1;
sum2 += min(cur, c2);
}
sum2 = min(sum2, c3);
cout << min(sum1 + sum2, c4) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long c1, c2, c3, c4;
while (cin >> c1 >> c2 >> c3 >> c4) {
long a[100000] = {0}, cp[10] = {0}, x, b[100000] = {0}, n, m, k = 1,
c[10000] = {0};
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
c[0] = c3;
for (int i = 0; i < n; i++) {
x = a[i];
cp[0] = x * c1;
cp[1] = c2;
sort(cp, cp + 2);
c[1] = c[1] + cp[0];
}
long m1[10000] = {0}, mm[10000] = {0};
sort(c, c + 2);
mm[0] = c[0];
c[0] = c3;
c[1] = 0;
for (int i = 0; i < m; i++) {
x = b[i];
cp[0] = x * c1;
cp[1] = c2;
sort(cp, cp + 2);
c[1] = c[1] + cp[0];
}
sort(c, c + 2);
mm[1] = c[0];
m1[0] = mm[0] + mm[1];
m1[1] = c4;
m1[2] = c3 * 2;
sort(m1, m1 + 3);
cout << m1[0] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4, B, T;
int main() {
int n, m, i, x, ans;
scanf("%d%d%d%d", &c1, &c2, &c3, &c4);
scanf("%d%d", &n, &m), B = T = 0;
for (i = 1; i <= n; i++) {
scanf("%d", &x);
if (x * c1 > c2)
B += c2;
else
B += x * c1;
}
for (i = 1; i <= m; i++) {
scanf("%d", &x);
if (x * c1 > c2)
T += c2;
else
T += x * c1;
}
ans = min(min(c3 + c3, B + T), min(min(c3 + B, c3 + T), c4));
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int32_t c1, c2, c3, c4;
int32_t n, m;
vector<int32_t> buses;
vector<int32_t> trolleys;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int32_t i = 0; i < n; i++) {
int32_t a;
cin >> a;
buses.push_back(a);
}
for (int32_t i = 0; i < m; i++) {
int32_t b;
cin >> b;
trolleys.push_back(b);
}
int32_t p1 = 0;
for (int32_t i = 0; i < n; i++) {
if (buses[i] * c1 > c2) {
p1 += c2;
} else {
p1 += buses[i] * c1;
}
if (c3 < p1) {
p1 = c3;
break;
}
}
int32_t p2 = 0;
for (int32_t i = 0; i < m; i++) {
if (trolleys[i] * c1 > c2) {
p2 += c2;
} else {
p2 += trolleys[i] * c1;
}
if (c3 < p2) {
p2 = c3;
break;
}
}
cout << (c4 < (p1 + p2) ? c4 : p1 + p2) << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 2 * 1e5 + 10;
long long n, m, c[10], a[1100], b[1100];
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> c[0] >> c[1] >> c[2] >> c[3];
cin >> n >> m;
long long sum1 = 0, sum2 = 0;
for (long long i = 0; i < n; ++i) {
cin >> a[i];
if (c[0] * a[i] > c[1])
sum1 += c[1];
else
sum1 += c[0] * a[i];
}
if (sum1 > c[2]) sum1 = c[2];
for (long long j = 0; j < m; ++j) {
cin >> b[j];
if (c[0] * b[j] > c[1])
sum2 += c[1];
else
sum2 += c[0] * b[j];
}
if (sum2 > c[2]) sum2 = c[2];
if (sum1 + sum2 > c[3])
cout << c[3] << "\n";
else
cout << sum1 + sum2 << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int C1, C2, C3, C4;
int N, M;
scanf("%d%d%d%d%d%d", &C1, &C2, &C3, &C4, &N, &M);
int A[1000];
int B[1000];
int S2 = 0;
for (int i = 0; i < N; ++i) {
scanf("%d", &A[i]);
S2 += A[i];
}
for (int i = 0; i < M; ++i) {
scanf("%d", &B[i]);
S2 += B[i];
}
int S = 0;
int S1 = 0;
for (int i = 0; i < N; ++i) {
S1 += min(C1 * A[i], C2);
}
S += min(S1, C3);
S1 = 0;
for (int i = 0; i < M; ++i) {
S1 += min(C1 * B[i], C2);
}
S += min(S1, C3);
S = min(S, min(S2 * C1, C4));
printf("%d", S);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int fpow(long long int x, long long int y,
long long int p = 1000000007) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) {
y--;
res *= x;
res = res % p;
}
x = x * x;
x = x % p;
y >>= 1;
}
return res;
}
int main() {
ios::sync_with_stdio(0);
long long int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
long long int b = 0, t = 0, b1[100003], t1[100003];
cin >> b >> t;
long long int sumb = 0, sumt = 0;
for (long long int i = 0; i < b; i++) {
cin >> b1[i];
sumb += b1[i];
}
for (long long int i = 0; i < t; i++) {
cin >> t1[i];
sumt += t1[i];
}
long long int f = 0;
for (long long int i = 0; i < b; i++) {
f += min(b1[i] * c1, c2);
}
f = min(f, c3);
long long int x = 0;
for (long long int i = 0; i < t; i++) {
x += min(t1[i] * c1, c2);
}
x = min(x, c3);
long long int ans = min(x + f, c4);
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
int n, m, suma = 0, sumb = 0, sum;
cin >> n >> m;
int *a = new int[n];
int *b = new int[m];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] * c1 > c2)
suma += c2;
else
suma += a[i] * c1;
}
for (int i = 0; i < m; i++) {
cin >> b[i];
if (b[i] * c1 > c2)
sumb += c2;
else
sumb += b[i] * c1;
}
if (c3 + c3 <= c4 && c3 + c3 <= suma + sumb && c3 + c3 <= c3 + sumb &&
c3 + c3 <= c3 + suma) {
cout << c3 + c3;
} else {
if (c4 <= c3 + c3 && c4 <= suma + sumb && c4 <= c3 + sumb &&
c4 <= c3 + suma)
cout << c4;
else {
if (suma + sumb <= c3 + c3 && suma + sumb <= c4 &&
suma + sumb <= c3 + sumb && suma + sumb <= c3 + suma)
cout << suma + sumb;
else {
if (c3 + sumb <= c3 + c3 && c3 + sumb <= c4 &&
c3 + sumb <= suma + sumb && c3 + sumb <= c3 + suma)
cout << c3 + sumb;
else {
if (c3 + suma <= c3 + c3 && c3 + suma <= c4 &&
c3 + suma <= suma + sumb && c3 + suma <= c3 + sumb)
cout << suma + c3;
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d, i, j, summ = 0, summ2 = 0, bus[1009], tro[1009], m, n;
cin >> a >> b >> c >> d >> n >> m;
for (i = 0; i < n; i++) {
cin >> bus[i];
}
for (i = 0; i < m; i++) {
cin >> tro[i];
}
for (i = 0; i < n; i++) {
bus[i] = bus[i] * a;
}
for (i = 0; i < n; i++) {
if (bus[i] > b) bus[i] = b;
summ += bus[i];
}
if (summ > c) summ = c;
for (i = 0; i < m; i++) {
tro[i] = tro[i] * a;
}
for (i = 0; i < m; i++) {
if (tro[i] > b) tro[i] = b;
summ2 += tro[i];
}
if (summ2 > c) summ2 = c;
summ = summ + summ2;
if (summ > d) summ = d;
cout << summ << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int c1, c2, c3, c4;
int a[1005];
int b[1005];
void Read() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
int i;
for (i = 1; i <= n; i++) cin >> a[i];
for (i = 1; i <= m; i++) cin >> b[i];
}
int Rez(int a[], int n) {
int i;
int s, p;
s = 0;
for (i = 1; i <= n; i++) {
p = a[i] * c1;
s += (p > c2) ? c2 : p;
}
if (s > c3) return c3;
return s;
}
void Solve() {
int TRL;
int BUS;
TRL = Rez(a, n);
BUS = Rez(b, m);
if (TRL + BUS > c4)
cout << c4 << "\n";
else
cout << TRL + BUS << "\n";
}
int main() {
Read();
Solve();
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T _abs(T n) {
return (n < 0 ? -n : n);
}
template <class T>
T sq(T x) {
return x * x;
}
template <class T>
T gcd(T a, T b) {
return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
return (a / gcd<T>(a, b) * b);
}
template <class T>
T _max(T a, T b) {
return (!(a < b) ? a : b);
}
template <class T>
T _min(T a, T b) {
return (a < b ? a : b);
}
const int INF = 0x7f7f7f7f;
template <class T>
void deb(T e) {
cout << e << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
cout << e1 << "\t" << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
cout << e1 << "\t" << e2 << "\t" << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
cout << e1 << "\t" << e2 << "\t" << e3 << "\t" << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
cout << e1 << "\t" << e2 << "\t" << e3 << "\t" << e4 << "\t" << e5 << endl;
}
template <class T>
void deb(vector<T> e) {
int i;
for (i = 0; i < (int)e.size(); i++) cout << e[i] << " ";
cout << endl;
}
template <class T>
void deb(vector<T> e, int n) {
int i;
for (i = 0; i < n; i++) cout << e[i] << " ";
cout << endl;
}
template <class T>
void deb(vector<basic_string<T> > e) {
int i, j;
for (i = 0; i < (int)e.size(); i++) {
for (j = 0; j < (int)e[i].size(); j++) cout << e[i][j];
cout << endl;
}
cout << endl;
}
template <class T>
void deb(vector<basic_string<T> > e, int row, int col) {
int i, j;
for (i = 0; i < row; i++) {
for (j = 0; j < col; j++) cout << e[i][j];
cout << endl;
}
cout << endl;
}
template <class T>
void deb(vector<vector<T> > e, int row, int col) {
int i, j;
for (i = 0; i < row; i++) {
for (j = 0; j < col; j++) cout << e[i][j] << "\t";
cout << endl;
}
cout << endl;
}
template <class T>
void deb(T e[50005][50005], int row, int col) {
int i, j;
for (i = 0; i < row; i++) {
for (j = 0; j < col; j++) cout << e[i][j] << " ";
cout << endl;
}
}
template <class T>
void deb(T e[], int row) {
int i;
for (i = 0; i < row; i++) cout << e[i] << " ";
cout << endl;
}
template <class T>
inline bool isPrime(T n) {
if (n <= 1) return false;
for (T i = 2; i * i <= n; i++)
if (n % i == 0) return false;
return true;
}
template <class T>
string toString(T n) {
ostringstream oss;
oss << n;
oss.flush();
return oss.str();
}
int toInt(string s) {
int r = 0;
istringstream sin(s);
sin >> r;
return r;
}
bool IsVowel(char ch) {
ch = tolower(ch);
if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u')
return true;
return false;
}
bool isUpper(char c) { return c >= 'A' && c <= 'Z'; }
bool isLower(char c) { return c >= 'a' && c <= 'z'; }
long long int Pow(long long int B, long long int P) {
long long int R = 1;
while (P > 0) {
if (P % 2 == 1) R = (R * B);
P /= 2;
B = (B * B);
}
return R;
}
int BigMod(long long int B, long long int P, long long int M) {
long long int R = 1;
while (P > 0) {
if (P % 2 == 1) {
R = (R * B) % M;
}
P /= 2;
B = (B * B) % M;
}
return (int)R;
}
void binprint(long long int mask, long long int n) {
long long int i;
string s = "";
do {
s += (mask % 2 + '0');
mask /= 2;
} while (mask);
reverse(s.begin(), s.end());
s = string(max(n - (int)s.size(), 0LL), '0') + s;
for (i = (int)s.size() - n; i < (int)s.size(); i++) printf("%c", s[i]);
printf("\n");
}
void ASCII_Chart() {
int i, j, k;
printf("ASCII Chart:(30-129)\n");
for (i = 30; i < 50; i++) {
for (j = 0; j < 5; j++) {
k = i + j * 20;
printf("%3d---> '%c' ", k, k);
}
printf("\n");
}
}
int main() {
int i, j, k, u, v, w, x, y, z, a, b, c, tcase, t = 0, m, n, res, cnt = 0, c1,
c2, c3, c4, sumb, sumt, rest;
vector<int> bus, trol;
while (cin >> c1 >> c2 >> c3 >> c4) {
sumb = 0;
sumt = 0;
cin >> b >> t;
bus.clear();
trol.clear();
res = 0;
for (i = 0; i < b; i++) {
cin >> x;
bus.push_back(x);
sumb += x;
if ((c1 * x) > c2)
res += c2;
else
res += (c1 * x);
}
res = min(res, c3);
rest = 0;
for (i = 0; i < t; i++) {
cin >> x;
trol.push_back(x);
sumt += x;
if ((c1 * x) > c2)
rest += c2;
else
rest += (c1 * x);
}
rest = min(rest, c3);
res = min(res + rest, c4);
printf("%d\n", res);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4, n, m, s1, s2;
int main() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
s1 = 0;
s2 = 0;
for (int i = 0; i < (n); i++) {
int c;
cin >> c;
if (c * c1 > c2)
s1 += c2;
else
s1 += c * c1;
}
if (s1 > c3) s1 = c3;
for (int i = 0; i < (m); i++) {
int c;
cin >> c;
if (c * c1 > c2)
s2 += c2;
else
s2 += c * c1;
}
if (s2 > c3) s2 = c3;
int ans = 0;
if (s1 + s2 > c4)
ans = c4;
else
ans = s1 + s2;
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, n, m;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
int a[1000], b[1000];
for (int i = 0; i < n; i++) cin >> a[i];
for (int j = 0; j < m; j++) cin >> b[j];
int min;
min = c4;
int x = 0;
for (int i = 0; i < n; i++) {
if (a[i] * c1 < c2)
x += a[i] * c1;
else
x += c2;
}
int y = 0;
for (int i = 0; i < m; i++) {
if (b[i] * c1 < c2)
y += b[i] * c1;
else
y += c2;
}
if (x > c3) x = c3;
if (y > c3) y = c3;
if ((x + y) < min) min = x + y;
cout << min;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, m, c1, c2, c3, c4, a = 0, b = 0, x;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> x;
a += min(x * c1, c2);
}
a = min(a, c3);
for (int i = 0; i < m; i++) {
cin >> x;
b += min(x * c1, c2);
}
b = min(b, c3);
cout << min(a + b, c4);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4;
int n, m;
int r[5][3];
int main() {
cin >> c1 >> c2 >> c3 >> c4;
int res = c4;
cin >> n >> m;
int q;
for (int i = 0; i < n; i++) {
cin >> q;
r[1][0] += min(c2, c1 * q);
r[3][0] = c3;
}
for (int i = 0; i < m; i++) {
cin >> q;
r[1][1] += min(c2, c1 * q);
r[3][1] = c3;
}
int a, b;
a = min(r[1][0], r[3][0]);
b = min(r[1][1], r[3][1]);
res = min(res, a + b);
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
const long long MAX = 1e5 + 7;
const long long dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const long long dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
long long i, j, k, t, n, q, l, r, mid;
long long tsum, bsum, x, c1, c2, c3, c4, nbc, ntc, sum;
void solve() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> nbc >> ntc;
for (i = 0; i < nbc; i++) {
cin >> x;
bsum += min(c1 * x, c2);
}
if (bsum > c3) {
sum += c3;
} else
sum += bsum;
for (i = 0; i < ntc; i++) {
cin >> x;
tsum += min(c1 * x, c2);
}
if (tsum > c3) {
sum += c3;
} else
sum += tsum;
if (sum < c4) {
cout << sum << endl;
} else {
cout << c4 << endl;
}
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, n, m, ans1 = 0, ans2 = 0, a, b;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a;
ans1 += min(a * c1, c2);
}
for (int i = 1; i <= m; i++) {
cin >> b;
ans2 += min(b * c1, c2);
}
ans1 = min(ans1, c3), ans2 = min(ans2, c3);
cout << min(ans1 + ans2, c4) << endl;
return 0;
}
|
#include <bits/stdc++.h>
const int INF = 1e9;
const int N = 312312;
const double PI = 3.1415926535897932384626433832795;
using namespace std;
int a[N], b[N], n, m, c1, c2, c3, c4, c, i, as = 0, s1, s2;
int main() {
ios_base ::sync_with_stdio();
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (c = 1; c <= n; c++) {
cin >> a[c];
}
for (c = 1; c <= m; c++) {
cin >> b[c];
}
for (c = 1; c <= n; c++) {
s1 += min(a[c] * c1, c2);
}
for (c = 1; c <= m; c++) {
s2 += min(b[c] * c1, c2);
}
s1 = min(s1, c3);
s2 = min(s2, c3);
s1 += s2;
cout << min(s1, c4);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, a[1416], b[1416], c1, c2, c3, c4, zjy, gy, zyq;
inline int in() {
int s = 0, f = 1;
char c = getchar();
while (c > '9' || c < '0') {
if (c == '-') {
f = -1;
}
c = getchar();
}
while (c <= '9' && c >= '0') {
s *= 10;
s += c - '0';
c = getchar();
}
return s * f;
}
int main() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
a[i] = in();
}
for (int j = 1; j <= m; j++) {
b[j] = in();
}
for (int i = 1; i <= n; i++) {
zjy += min(c2, c1 * a[i]);
}
for (int i = 1; i <= m; i++) {
gy += min(c2, c1 * b[i]);
}
zyq = min(zjy, c3) + min(gy, c3);
zyq = min(zyq, c4);
cout << zyq;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int arr[4];
for (int i = 0; i < 4; cin >> arr[i++])
;
int n, m, x;
cin >> n >> m;
int c1;
int type_one = 0, type_two = 0, ans, res = 0;
for (int i = 0; i < n; i++) {
cin >> x;
for (int j = 0; j < 2; j++) {
c1 = 0;
c1 += (x * arr[0]);
}
if (c1 < arr[1])
type_one += c1;
else
type_one += arr[1];
}
if (type_one < arr[2])
res += type_one;
else
res += arr[2];
for (int i = 0; i < m; i++) {
cin >> x;
for (int j = 0; j < 2; j++) {
c1 = 0;
c1 += (x * arr[0]);
}
if (c1 < arr[1])
type_two += c1;
else
type_two += arr[1];
}
if (type_two < arr[2])
res += type_two;
else
res += arr[2];
if (res < arr[3])
ans = res;
else
ans = arr[3];
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4;
int n, m;
int bu, tr;
int main() {
scanf("%d %d %d %d", &c1, &c2, &c3, &c4);
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) {
int t;
scanf("%d", &t);
bu += (t * c1 > c2 ? c2 : t * c1);
}
for (int i = 0; i < m; i++) {
int t;
scanf("%d", &t);
tr += (t * c1 > c2 ? c2 : t * c1);
}
bu = (bu > c3 ? c3 : bu);
tr = (tr > c3 ? c3 : tr);
printf("%d", (c4 > bu + tr ? bu + tr : c4));
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
vector<long long> vv;
set<long long> st;
long long x, y, z;
string s, s1, s2, s3, s4, s5;
void memset_ll(long long a[], long long v, long long n) {
for (long long i = 0; i < n; i++) a[i] = v;
}
void memset_s(char a[], char v, long long n) {
for (long long i = 0; i < n; i++) a[i] = v;
}
int compare(const void* a, const void* b) {
return (*(long long*)a - *(long long*)b);
}
void q_sort(long long a[], long long n) {
qsort(a, n, sizeof(long long), compare);
}
static int compare1(const void* a, const void* b) {
if (*(double*)a > *(double*)b)
return 1;
else if (*(double*)a < *(double*)b)
return -1;
else
return 0;
}
void q_sort_d(double a[], long long n) {
qsort(a, n, sizeof(double), compare1);
}
string trans_upper(string ss) {
transform(ss.begin(), ss.end(), ss.begin(), ::toupper);
return ss;
}
long long power(long long a, long long b) {
long long pow = 1;
while (b) {
if (b & 1) {
pow = pow * a;
--b;
}
a = a * a;
b = b / 2;
}
return pow;
}
long long bsearch(long long arr[], long long l, long long r, long long x) {
if (r >= l) {
long long mid = l + (r - l) / 2;
if (arr[mid] == x) return mid;
if (arr[mid] > x) return bsearch(arr, l, mid - 1, x);
return bsearch(arr, mid + 1, r, x);
}
return -1;
}
long long fact(long long n) {
long long f = 1, i;
for (i = 1; i <= n; i++) f = f * i;
return f;
}
long long is_prime(long long n) {
long long i, j, k = 1;
for (i = 2; i <= n / 2; i++) {
if (n % i == 0) {
k = 0;
break;
}
}
return k;
}
long long vow(char c) {
long long k = 1;
long long l = 0;
if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u')
return k;
else
return l;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t, l, p, q, n, m, o = 0, r, i, j, h, k, e = 0, d = 0, f = 0, g = 0;
long long temp = 0, nl, np;
double p1, p2 = 0.0, p3 = 0.0, p4, p5, p6, pp = 0.0, ppp;
p1 = 3.1415926536;
long long x1, x2, y1, y2, uu = 0, dd = 0, rr = 0, lll = 0;
cin >> uu >> dd >> rr >> lll;
cin >> n >> m;
for (i = 0; i < n; i++) {
cin >> p;
t = p * uu;
l = min(t, dd);
d += l;
}
l = min(d, rr);
e += l;
d = 0;
for (i = 0; i < m; i++) {
cin >> p;
t = p * uu;
l = min(t, dd);
d += l;
}
l = min(d, rr);
e += l;
l = min(e, lll);
cout << l;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long p1 = 0, p2 = 0;
int n, m, c1, c2, c3, c4, a;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a;
if (a * c1 < c2)
p1 += a * c1;
else
p1 += c2;
}
if (p1 > c3) p1 = c3;
for (int i = 0; i < m; i++) {
cin >> a;
if (a * c1 < c2)
p2 += a * c1;
else
p2 += c2;
}
if (p2 > c3) p2 = c3;
if (p2 + p1 < c4)
cout << p2 + p1;
else
cout << c4;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int a, b, c, d;
cin >> a >> b >> c >> d;
int e, f;
cin >> e >> f;
vector<int> data(e);
int total = 0;
for (int i = 0; i < e; ++i) {
cin >> data[i];
total += min(data[i] * a, b);
}
int totalBis = min(total, c);
total = 0;
vector<int> datas(f);
for (int i = 0; i < f; ++i) {
cin >> datas[i];
total += min(datas[i] * a, b);
}
int totalTroli = min(total, c);
cout << min(totalBis + totalTroli, d);
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4, n, m;
void solve() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
int ans = 0, temp = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a * c1 > c2)
temp += c2;
else
temp += a * c1;
}
if (temp > c3) temp = c3;
ans = temp;
temp = 0;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
if (a * c1 > c2)
temp += c2;
else
temp += a * c1;
}
if (temp > c3) temp = c3;
ans += temp;
if (ans > c4) ans = c4;
cout << ans << endl;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using ull = unsigned long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll a, b, c, d;
cin >> a >> b >> c >> d;
int n, m;
cin >> n >> m;
ll ans1 = 0, ans2 = 0;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
ans1 += min(p * a, b);
}
ans1 = min(ans1, c);
for (int i = 0; i < m; i++) {
int p;
cin >> p;
ans2 += min(p * a, b);
}
ans2 = min(ans2, c);
cout << min(ans1 + ans2, d) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1111111;
int c1, c2, c3, c4;
int n, m;
int a[N], b[N];
int main() {
scanf("%d%d%d%d", &c1, &c2, &c3, &c4);
scanf("%d%d", &n, &m);
int res1 = 0, res2 = 0, res = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
res1 += min(a[i] * c1, c2);
}
res1 = min(res1, c3);
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
res2 += min(b[i] * c1, c2);
}
res2 = min(res2, c3);
res = min(res1 + res2, c4);
printf("%d", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4;
int n, m;
int a[1010], b[1010];
long sum = 0;
int main() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
for (int i = 0; i < m; ++i) {
scanf("%d", &b[i]);
}
sum = c4;
if (sum > 2 * c3) {
sum = 2 * c3;
}
long sumB = 0;
for (int i = 0; i < n; ++i) {
a[i] = min(a[i] * c1, c2);
sumB += a[i];
}
if (sumB > c3) {
sumB = c3;
}
long sumT = 0;
for (int i = 0; i < m; ++i) {
b[i] = min(b[i] * c1, c2);
sumT += b[i];
}
if (sumT > c3) {
sumT = c3;
}
if (sum > sumB + sumT) {
sum = sumB + sumT;
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int b[2000], t[2000];
int main() {
long long n, m, c1, c2, c3, c4, ans, ans2 = 0, ans3 = 0;
cin >> c1 >> c2 >> c3 >> c4;
ans = min(c4, c3 * 2);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> b[i];
ans2 += min(b[i] * c1, c2);
}
for (int i = 0; i < m; i++) {
cin >> t[i];
ans3 += min(t[i] * c1, c2);
}
ans = min(ans, min(ans2 + ans3, min(ans2, ans3) + c3));
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int c1, c2, c3, c4;
int num_buses;
int num_trolleys;
scanf("%d %d %d %d", &c1, &c2, &c3, &c4);
scanf("%d %d", &num_buses, &num_trolleys);
int sum_bus_rides = 0;
int sum_trolley_rides = 0;
int bus_cost = 0, trolley_cost = 0;
int num_rides;
for (int i = 0; i < num_buses; i++) {
scanf("%d", &num_rides);
sum_bus_rides += num_rides;
bus_cost += min(num_rides * c1, c2);
}
for (int i = 0; i < num_trolleys; i++) {
scanf("%d", &num_rides);
sum_trolley_rides += num_rides;
trolley_cost += min(num_rides * c1, c2);
}
int cost;
int min_bus_cost = sum_bus_rides * c1;
min_bus_cost = min(bus_cost, min_bus_cost);
min_bus_cost = min(c3, min_bus_cost);
int min_trolley_cost = sum_trolley_rides * c1;
min_trolley_cost = min(trolley_cost, min_trolley_cost);
min_trolley_cost = min(c3, min_trolley_cost);
int min_travel_cost = min_bus_cost + min_trolley_cost;
min_travel_cost = min(min_travel_cost, c4);
cout << min_travel_cost << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4, n, m, a, b, res1 = 0, res2 = 0;
int main() {
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a;
if (a != 0) res1 += min(a * c1, c2);
}
for (int i = 0; i < m; i++) {
cin >> b;
if (b != 0) res2 += min(b * c1, c2);
}
cout << min(min(min(min(res1, res2) + c3, res1 + res2), 2 * c3), c4);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int c1, c2, c3, c4, x = 0, y = 0, z, i;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
int a[n], b[m];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < m; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
x += min(a[i] * c1, c2);
}
x = min(x, c3);
for (i = 0; i < m; i++) {
y += min(b[i] * c1, c2);
}
y = min(y, c3);
z = min(x + y, c4);
cout << z;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4;
long long c[5], n, m, a[N], b[N], ans = 1e18;
inline long long f(long long e, long long* a) {
long long cur = 0;
for (int i = 1; i <= e; i++) {
cur = cur + min(c[2], a[i] * c[1]);
}
return min(c[3], cur);
}
int main() {
for (int i = 1; i <= 4; i++) {
cin >> c[i];
}
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= m; i++) {
cin >> b[i];
}
cout << min(f(n, a) + f(m, b), c[4]);
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b > a) return gcd(b, a);
return b == 0 ? a : gcd(b, a % b);
}
void swap(int *m, int *n) {
int temp = *n;
*n = *m;
*m = temp;
}
struct sort_pred {
bool operator()(const std::pair<int, int> &left,
const std::pair<int, int> &right) {
return left.first < right.first;
}
};
int compare(const void *a, const void *b) {
const int *ia = (const int *)a;
const int *ib = (const int *)b;
return *ia - *ib;
}
int main() {
int c1, c2, c3, c4;
scanf("%d %d %d %d", &c1, &c2, &c3, &c4);
int n, m;
scanf("%d %d", &n, &m);
int bus[n], trolley[m];
long long int buscost = 0, trolleycost = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &bus[i]);
if (c1 * bus[i] < c2)
buscost = (long long)buscost + (long long)c1 * bus[i];
else
buscost += c2;
}
for (int i = 0; i < m; i++) {
scanf("%d", &trolley[i]);
if (c1 * trolley[i] < c2)
trolleycost = (long long)trolleycost + (long long)c1 * trolley[i];
else
trolleycost += c2;
}
if (buscost > c3) buscost = c3;
if (trolleycost > c3) trolleycost = c3;
long long int ans = buscost + trolleycost;
if (ans < c4)
cout << ans << endl;
else
cout << c4 << endl;
return 0;
}
|
#include <bits/stdc++.h>
const long long INF = 2009000999;
const float cp = 2 * acos(0.0);
const float eps = 1e-18;
using namespace std;
int r[1001], r1[1001];
int sum(int x) {
int s = 0;
for (int(i) = (1); (i) <= (x); i++) s += r[i];
return s;
}
int main() {
long long a, b, c, d, n, m, s = 0, s1 = 0, s11 = 0, s12 = 0;
cin >> a >> b >> c >> d >> n >> m;
for (int(i) = (1); (i) <= (n); i++) {
cin >> r[i];
s += r[i];
if (r[i] * a < b)
s11 += r[i] * a;
else
s11 += b;
}
for (int(i) = (1); (i) <= (m); i++) {
cin >> r1[i];
s1 += r1[i];
if (r1[i] * a < b)
s12 += r1[i] * a;
else
s12 += b;
}
int q = s11 + s12;
if (s12 + c < q) q = s12 + c;
if (s11 + c < q) q = s11 + c;
if (c + c < q) q = c + c;
if (d < q) q = d;
cout << q;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
int a[1100], b[1100], m, n;
int mina = 0, minb = 0, minl = 999999, suma = 0, sumb = 0;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
mina += min(c2, a[i] * c1);
}
for (int i = 0; i < m; i++) {
cin >> b[i];
minb += min(c2, b[i] * c1);
}
mina = min(mina, c3);
minb = min(minb, c3);
minl = min(c4, mina + minb);
cout << minl << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, n, m, ss = 0, sum = 0, i, x;
cin >> a >> b >> c >> d >> n >> m;
for (i = 0; i < n; i++) {
cin >> x;
if (a * x < b)
ss += a * x;
else
ss += b;
}
if (ss > c)
sum += c;
else
sum += ss;
ss = 0;
for (i = 0; i < m; i++) {
cin >> x;
if (a * x < b)
ss += a * x;
else
ss += b;
}
if (ss > c)
sum += c;
else
sum += ss;
if (sum > d) sum = d;
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4, n, m, a[1001], b[1001], suma[1001], sumb[1001];
int auFull, tuFull, answer;
int main() {
scanf("%d %d %d %d", &c1, &c2, &c3, &c4);
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
suma[i] = c1 * a[i];
if (c2 <= suma[i]) suma[i] = c2;
auFull += suma[i];
}
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
sumb[i] = c1 * b[i];
if (c2 <= sumb[i]) sumb[i] = c2;
tuFull += sumb[i];
}
if (auFull >= c3) auFull = c3;
if (tuFull >= c3) tuFull = c3;
answer = auFull + tuFull;
if (answer >= c4) answer = c4;
printf("%d", answer);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
vector<int> c(4);
for (int i = 0; i < 4; i++) cin >> c[i];
int N = 0, M = 0, ns, ms;
cin >> ns >> ms;
vector<int> n(ns), m(ms);
for (int i = 0; i < ns; i++) {
cin >> n[i];
n[i] = min(n[i] * c[0], c[1]);
N += n[i];
}
for (int i = 0; i < ms; i++) {
cin >> m[i];
m[i] = min(m[i] * c[0], c[1]);
M += m[i];
}
N = min(N, c[2]);
M = min(M, c[2]);
cout << min(N + M, c[3]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, n, m, i;
scanf("%d%d%d%d", &c1, &c2, &c3, &c4);
scanf("%d%d", &n, &m);
int x, s1 = 0, s2 = 0;
for (i = 1; i <= n; i++) {
scanf("%d", &x);
x = min(x * c1, c2);
s1 += x;
}
for (i = 1; i <= m; i++) {
scanf("%d", &x);
x = min(x * c1, c2);
s2 += x;
}
s1 = min(s1, c3);
s2 = min(s2, c3);
int ans = min(c4, s1 + s2);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
long long n, m;
cin >> n >> m;
long long a[n], b[m];
for (long long i = 0; i < n; i++) cin >> a[i];
for (long long i = 0; i < m; i++) cin >> b[i];
long long bc = 0, tc = 0, tot = 0;
for (long long i = 0; i < n; i++) {
bc += min(a[i] * c1, c2);
}
bc = min(bc, c3);
for (long long i = 0; i < m; i++) {
tc += min(b[i] * c1, c2);
}
tc = min(tc, c3);
tot = min(tc + bc, c4);
cout << tot;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
int a[n], b[m];
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
int sb = 0, st = 0;
for (int i = 0; i < n; i++) sb += min(a[i] * c1, c2);
sb = min(sb, c3);
for (int i = 0; i < m; i++) st += min(b[i] * c1, c2);
st = min(st, c3);
cout << min(st + sb, c4);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
int n, m;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
int a[n], b[m];
int val1 = 0, val2 = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (c1 * a[i] < c2) {
val1 += c1 * a[i];
} else {
val1 += c2;
}
}
for (int i = 0; i < m; i++) {
cin >> b[i];
if (c1 * b[i] < c2) {
val2 += c1 * b[i];
} else {
val2 += c2;
}
}
int value1 = min(c3, val1);
int value2 = min(c3, val2);
int answer = min(value1 + value2, c4);
cout << answer << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int c1, c2, c3, c4, n, m;
scanf("%d%d%d%d", &c1, &c2, &c3, &c4);
scanf("%d%d", &n, &m);
int a[n + 1], b[m + 1], i;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
int bus = 0, tro = 0;
for (i = 0; i < n; i++) {
if (a[i] * c1 <= c2) {
bus = bus + (a[i] * c1);
} else
bus = bus + c2;
}
if (bus > c3) bus = c3;
for (i = 0; i < m; i++) {
if (b[i] * c1 <= c2) {
tro = tro + (b[i] * c1);
} else
tro = tro + c2;
}
if (tro > c3) tro = c3;
if (bus + tro < c4) {
printf("%d\n", bus + tro);
} else
printf("%d\n", c4);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4, n, m;
const int maxn = 1050;
int a[maxn], b[maxn];
int p, q, r, s;
int x, y;
int main() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
x += min(c1 * a[i], c2);
}
for (int i = 0; i < m; i++) {
cin >> b[i];
y += min(c1 * b[i], c2);
}
cout << min(min(x, c3) + min(y, c3), c4) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double inf = 1e18 + 7;
const double mod = 2e9 + 7;
const double eps = 1e-12;
const double PI = 2 * acos(0.0);
const double E = 2.71828;
const double INF = 1000000000.0;
int n, m, c1, c2, c3, c4, a[1010], b[1010];
int main() {
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
int res1 = 0, res2 = 0;
for (int(i) = 0; (i) < (n); (i)++) {
cin >> a[i];
res1 += min(c2, a[i] * c1);
}
for (int(i) = 0; (i) < (m); (i)++) {
cin >> b[i];
res2 += min(c2, b[i] * c1);
}
res1 = min(res1, c3);
res2 = min(res2, c3);
cout << min(c4, res1 + res2);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int i, j, n, m, a, b, c1, c2, c3, c4, res, res2;
while ((scanf("%d", &c1)) != EOF) {
scanf("%d %d %d", &c2, &c3, &c4);
scanf("%d %d", &n, &m);
for (i = res = 0; i < n; i++) {
scanf("%d", &a);
res += c2 < a * c1 ? c2 : a * c1;
}
res = c3 < res ? c3 : res;
for (i = res2 = 0; i < m; i++) {
scanf("%d", &b);
res2 += c2 < b * c1 ? c2 : b * c1;
}
res2 = c3 < res2 ? c3 : res2;
printf("%d\n", c4 < res + res2 ? c4 : res + res2);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4, cnt, bus, trolley, n, m, t;
int main() {
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
while (n-- && cin >> t) bus += min(c2, t * c1);
while (m-- && cin >> t) trolley += min(c2, t * c1);
bus = min(bus, c3), trolley = min(trolley, c3);
cout << min(bus + trolley, c4);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arrn[1234], arrm[1234];
vector<long long> v1, v2;
int main() {
long long c1, c2, c3, c4, cum1 = 0, cum2 = 0;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> arrn[i];
cum1 = cum1 + min(arrn[i] * c1, c2);
}
cum1 = min(cum1, c3);
for (int i = 0; i < m; ++i) {
cin >> arrm[i];
cum2 = cum2 + min(arrm[i] * c1, c2);
}
cum2 = min(cum2, c3);
cout << min(cum2 + cum1, c4);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1005;
int n, m, c1, c2, c3, c4, a[MAXN], b[MAXN], mini, tro, bus, cnt, tab[MAXN],
tab1[MAXN];
int main() {
scanf("%d %d %d %d", &c1, &c2, &c3, &c4);
scanf("%d %d", &n, &m);
for (int i = 0; i < (n); i++) scanf("%d", &a[i]);
for (int i = 0; i < (m); i++) scanf("%d", &b[i]);
mini = c4;
for (int i = 0; i < (n); i++) {
if (a[i] * c1 <= c2)
tab[i] = a[i] * c1;
else
tab[i] = c2;
cnt += tab[i];
}
if (cnt <= c3)
bus = cnt;
else
bus = c3;
cnt = 0;
for (int i = 0; i < (m); i++) {
if (b[i] * c1 <= c2)
tab1[i] = b[i] * c1;
else
tab1[i] = c2;
cnt += tab1[i];
}
if (cnt <= c3)
tro = cnt;
else
tro = c3;
if (mini > tro + bus) mini = tro + bus;
printf("%d\n", mini);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, m, c1, c2, c3, c4, d, s1, s2, s3, s4, i;
scanf("%d%d%d%d%d%d", &c1, &c2, &c3, &c4, &n, &m);
s1 = 0;
s2 = 0;
s3 = 0;
s4 = 0;
for (i = 0; i < n; i++) {
scanf("%d", &d);
if (d * c1 > c2)
s1 += c2;
else
s1 += d * c1;
}
if (s1 > c3) s1 = c3;
for (i = 0; i < m; i++) {
scanf("%d", &d);
if (d * c1 > c2)
s2 += c2;
else
s2 += d * c1;
}
if (s2 > c3) s2 = c3;
s3 = s2 + s1;
if (c4 < s3) s3 = c4;
printf("%d\n", s3);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
int a[n];
int b[m];
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < m; ++i) cin >> b[i];
int trolley = 0;
int trolley1 = 0;
int bus = 0;
int bus1 = 0;
for (int i = 0; i < n; ++i) bus = bus + a[i] * c1;
bus1 = bus;
for (int i = 0; i < m; ++i) trolley = trolley + b[i] * c1;
trolley1 = trolley;
for (int i = 0; i < n; ++i) {
int s = bus - a[i] * c1 + c2;
if (s < bus) bus = s;
}
for (int i = 0; i < m; ++i) {
int s = trolley - b[i] * c1 + c2;
if (s < trolley) trolley = s;
}
if (c3 < trolley) trolley = c3;
if (bus > c3) bus = c3;
if ((bus + trolley) > c4)
cout << c4;
else
cout << bus + trolley;
return 0;
}
|
#include <bits/stdc++.h>
int32_t main() {
uint32_t c1, c2, c3, c4;
std::cin >> c1 >> c2 >> c3 >> c4;
uint32_t n, m;
std::cin >> n >> m;
uint32_t b_cost = 0;
for (int64_t i = (0); i < (n); i++) {
uint32_t a;
std::cin >> a;
b_cost += (c1 * a < c2) ? c1 * a : c2;
}
if (c3 < b_cost) {
b_cost = c3;
}
uint32_t t_cost = 0;
for (int64_t i = (0); i < (m); i++) {
uint32_t b;
std::cin >> b;
t_cost += (c1 * b < c2) ? c1 * b : c2;
}
if (c3 < t_cost) {
t_cost = c3;
}
uint32_t cost = b_cost + t_cost;
if (c4 < cost) {
cost = c4;
}
std::cout << cost << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, n, m, x, s1 = 0, s2 = 0, ret;
scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &n, &m);
while (n--) {
scanf("%d", &x);
s1 += min(x * a, b);
}
while (m--) {
scanf("%d", &x);
s2 += min(x * a, b);
}
ret = min(d, min(2 * c, min(c + min(s1, s2), s1 + s2)));
printf("%d", ret);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int on_bit(int x, int pos) {
x |= (1 << pos);
return x;
}
int off_bit(int x, int pos) {
x &= ~(1 << pos);
return x;
}
bool is_on_bit(int x, int pos) { return ((x & (1 << pos)) != 0); }
int flip_bit(int x, int pos) {
x ^= (1 << pos);
return x;
}
int lsb(int x) { return x & (-x); }
int on_bit_all(int x, int pos) {
x = (1 << pos) - 1;
return x;
}
const double EPS = 1e-9;
const double PI = 2 * acos(0.0);
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int add(long long a, long long b) { return ((a % MOD) + (b % MOD)) % MOD; }
int sub(long long a, long long b) { return ((a % MOD) - (b % MOD)) % MOD; }
int mult(long long a, long long b) { return ((a % MOD) * (b % MOD)) % MOD; }
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const long long N = 1111;
long long a[N];
long long b[N];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
long long n, m;
cin >> n >> m;
for (long long i = 0; i < (long long)n; i++) cin >> a[i];
for (long long i = 0; i < (long long)m; i++) cin >> b[i];
long long all_a = 0;
long long all_b = 0;
for (long long i = 0; i < (long long)n; i++) all_a += min(c1 * a[i], c2);
for (long long i = 0; i < (long long)m; i++) all_b += min(c1 * b[i], c2);
all_a = min(all_a, c3);
all_b = min(all_b, c3);
cout << min(all_a + all_b, c4) << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> costs(4);
int calc(int n) {
int res = 0;
for (int i = 0; i < n; ++i) {
int t;
cin >> t;
res += min(t * costs[0], costs[1]);
}
return min(res, costs[2]);
}
int main() {
for (int i = 0; i < 4; ++i) {
cin >> costs[i];
}
int n, m;
cin >> n >> m;
cout << min(costs[3], calc(n) + calc(m)) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long c1, c2, c3, c4;
long long min_cal(long long t[], long long n) {
long long temp = 0, i;
for (i = 0; i < n; i++) {
temp += min(c2, t[i] * c1);
}
return (min(c3, temp));
}
long long min(long long a, long long b) { return a > b ? b : a; }
int main() {
long long n, m, ans;
int t, i, j;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
long long a[n], b[m];
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < m; i++) cin >> b[i];
ans = min(c4, min_cal(a, n) + min_cal(b, m));
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
int n, m;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
vector<int> vec_n, vec_m;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vec_n.push_back(x);
}
for (int i = 0; i < m; i++) {
int x;
cin >> x;
vec_m.push_back(x);
}
int sum1 = 0;
for (int i = 0; i < n; i++) {
sum1 += min(vec_n[i] * c1, c2);
}
int x1 = min(sum1, c3);
sum1 = 0;
for (int i = 0; i < m; i++) {
sum1 += min(vec_m[i] * c1, c2);
}
int x2 = min(sum1, c3);
int re = min(x1 + x2, c4);
cout << re << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1002;
const int MAXM = 1002;
int C1, C2, C3, C4;
int N, M;
int A[MAXN], B[MAXN];
int ans;
int main() {
scanf("%d%d%d%d", &C1, &C2, &C3, &C4);
scanf("%d%d", &N, &M);
for (int i = 0; i < N; i++) scanf("%d", &A[i]);
for (int i = 0; i < M; i++) scanf("%d", &B[i]);
ans = 0;
int sum1 = 0;
for (int i = 0; i < N; i++) sum1 += min(A[i] * C1, C2);
ans += min(sum1, C3);
int sum2 = 0;
for (int i = 0; i < M; i++) sum2 += min(B[i] * C1, C2);
ans += min(sum2, C3);
printf("%d\n", min(ans, C4));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, Nb, Nt, sum = 0, money_bus = 0, money_troley = 0,
Trip_bus = 0, Trip_troley = 0;
cin >> c1 >> c2 >> c3 >> c4 >> Nb >> Nt;
int x;
for (int i = 0; i < Nb; i++) {
cin >> x;
if (c1 * x < c2)
money_bus += c1 * x;
else
money_bus += c2;
}
if (money_bus > c3) money_bus = c3;
for (int i = 0; i < Nt; i++) {
cin >> x;
if (c1 * x < c2)
money_troley += c1 * x;
else
money_troley += c2;
}
if (money_troley > c3) money_troley = c3;
sum = money_bus + money_troley;
if (sum > c4)
cout << c4;
else
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4;
int fun(int *ar, int n) {
int sum = 0;
for (int i = 0; i < n; i++) sum += min(c1 * ar[i], c2);
return sum;
}
int main() {
int n, m, mini, cam, trol;
int ar1[1001], ar2[1001];
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
for (int i = 0; i < n; i++) cin >> ar1[i];
for (int i = 0; i < m; i++) cin >> ar2[i];
cam = fun(ar1, n);
trol = fun(ar2, m);
mini = cam + trol;
mini = min(mini, min(cam + c3, min(trol + c3, c3 * 2)));
mini = min(mini, c4);
cout << mini << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, c1, c2, c3, n, m, c4, t, busc, tc, ans;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
int a[n];
int b[m];
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < m; i++) cin >> b[i];
t = 0;
if (c2 > c1) {
t = c2 / c1;
}
busc = ans = tc = 0;
for (i = 0; i < n; i++) {
if (a[i] > t) {
busc += c2;
} else {
busc += (a[i] * c1);
}
}
if (busc > c3) {
busc = c3;
}
for (i = 0; i < m; i++) {
if (b[i] > t) {
tc += c2;
} else {
tc += (b[i] * c1);
}
}
if (tc > c3) {
tc = c3;
}
if (busc + tc > c4) {
ans = c4;
} else {
ans = busc + tc;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string tos(int a) {
ostringstream os("");
os << a;
return os.str();
}
int c1, c2, c3, c4;
int n, m;
int A[1000];
int B[1000];
int main() {
while (cin >> c1 >> c2 >> c3 >> c4) {
int val;
int sum1 = 0;
int sum2 = 0;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> val;
A[i] = min(c1 * val, c2);
sum1 += A[i];
}
for (int i = 0; i < m; ++i) {
cin >> val;
B[i] = min(c1 * val, c2);
sum2 += B[i];
}
int h1 = c4;
int h2 = min(sum1, c3) + min(sum2, c3);
int h3 = sum1 + sum2;
cout << min(h1, min(h2, h3)) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
};
long long int c1, c2, c3, c4, n, m;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
long long int bus = 0, tro = 0, i, b[n], t[m];
for (i = 0; i < n; i++) {
cin >> b[i];
b[i] = b[i] * c1;
b[i] = min(b[i], c2);
bus += b[i];
}
for (i = 0; i < m; i++) {
cin >> t[i];
t[i] = t[i] * c1;
t[i] = min(t[i], c2);
tro += t[i];
}
if (tro > c3) {
tro = c3;
}
if (bus > c3) {
bus = c3;
}
cout << min(bus + tro, c4);
}
|
#include <bits/stdc++.h>
using namespace std;
int read_int() {
char c = getchar();
int flag = 0;
if (c == '-') flag = 1;
while (c < '0' || c > '9') c = getchar();
int ret = 0;
while (c >= '0' && c <= '9') {
ret = 10 * ret + c - 48;
c = getchar();
}
if (flag) return -ret;
return ret;
}
int c1, c2, c3, c4, n, m;
int arr1[1010], arr2[1010];
int dp1[1010][1010][2][2];
int f(int pos1, int pos2, int sum, bool flag1, bool flag2) {
if (pos1 == n && pos2 == m) {
return sum;
}
if (dp1[pos1][pos2][flag1][flag2] != -1) return dp1[pos1][pos2][flag1][flag2];
int ret = 1 << 30;
ret = min(ret, c1 * arr1[pos1] + c1 * arr2[pos2] +
f(pos1 + 1, pos2 + 1, sum, flag1, flag2));
ret =
min(ret, c1 * arr1[pos1] + c2 + f(pos1 + 1, pos2 + 1, sum, flag1, flag2));
if (!flag2) {
ret = min(ret, c1 * arr1[pos1] + c3 + f(pos1 + 1, pos2 + 1, sum, flag1, 1));
} else {
ret = min(ret, c1 * arr1[pos1] + f(pos1 + 1, pos2 + 1, sum, flag1, 1));
}
ret =
min(ret, c2 + c1 * arr2[pos2] + f(pos1 + 1, pos2 + 1, sum, flag1, flag2));
ret = min(ret, c2 + c2 + f(pos1 + 1, pos2 + 1, sum, flag1, flag2));
if (!flag2) {
ret = min(ret, c2 + c3 + f(pos1 + 1, pos2 + 1, sum, flag1, 1));
} else {
ret = min(ret, c2 + f(pos1 + 1, pos2 + 1, sum, flag1, 1));
}
if (!flag1) {
ret = min(ret, c3 + c1 * arr2[pos2] + f(pos1 + 1, pos2 + 1, sum, 1, flag2));
} else {
ret = min(ret, c1 * arr2[pos2] + f(pos1 + 1, pos2 + 1, sum, 1, flag2));
}
if (!flag1) {
ret = min(ret, c3 + c2 + f(pos1 + 1, pos2 + 1, sum, 1, flag2));
} else {
ret = min(ret, c2 + f(pos1 + 1, pos2 + 1, sum, 1, flag2));
}
if (!flag1) {
if (!flag2)
ret = min(ret, c3 + c3 + f(pos1 + 1, pos2 + 1, sum, 1, 1));
else
ret = min(ret, c3 + f(pos1 + 1, pos2 + 1, sum, 1, 1));
} else {
if (!flag2)
ret = min(ret, c3 + f(pos1 + 1, pos2 + 1, sum, 1, 1));
else
ret = min(ret, f(pos1 + 1, pos2 + 1, sum, 1, 1));
}
ret = min(ret, c4);
return dp1[pos1][pos2][flag1][flag2] = ret;
}
int main() {
int i;
{
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (i = 0; i < n; i++) cin >> arr1[i];
for (i = 0; i < m; i++) cin >> arr2[i];
memset(dp1, -1, sizeof(dp1));
cout << f(0, 0, 0, 0, 0) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1005;
int c1, c2, c3, c4;
int N, M;
int B[MAX], T[MAX];
int main() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> N >> M;
for (int i = 0; i < N; i++) cin >> B[i];
for (int i = 0; i < M; i++) cin >> T[i];
int ans = 0, bsum = 0, tsum = 0;
for (int i = 0; i < N; i++) bsum += min(B[i] * c1, c2);
for (int i = 0; i < M; i++) tsum += min(T[i] * c1, c2);
bsum = min(bsum, c3);
tsum = min(tsum, c3);
ans = min(bsum + tsum, c4);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4, n, m, a, b, sumbus, sumtro;
int main() {
scanf("%d%d%d%d%d%d", &c1, &c2, &c3, &c4, &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &a), sumbus += min(c2, c1 * a);
for (int i = 1; i <= m; ++i) scanf("%d", &b), sumtro += min(c2, c1 * b);
return printf("%d", min(min(c3, sumbus) + min(c3, sumtro), c4)), 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1001];
int b[1001];
int main() {
int n, m, c1, c2, c3, c4;
scanf("%d%d%d%d", &c1, &c2, &c3, &c4);
scanf("%d%d", &n, &m);
int ans_a = 0;
int ans_b = 0;
for (size_t i = 1; i <= n; i++) {
scanf("%d", &a[i]);
ans_a = ans_a + min(c2, a[i] * c1);
}
for (size_t i = 1; i <= m; i++) {
scanf("%d", &b[i]);
ans_b = ans_b + min(c2, b[i] * c1);
}
int ans;
ans = min(c4, min(c3, ans_a) + min(c3, ans_b));
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1002], b[1002];
int main() {
int c1, c2, c3, c4, i, n, m, r, sa = 0, sb = 0;
scanf("%d%d%d%d%d%d", &c1, &c2, &c3, &c4, &n, &m);
for (i = 0; i < n; i++) {
scanf("%d", a + i);
a[i] *= c1;
a[i] = min(a[i], c2);
sa += a[i];
}
for (i = 0; i < m; i++) {
scanf("%d", b + i);
b[i] *= c1;
b[i] = min(b[i], c2);
sb += b[i];
}
r = min(c4, 2 * c3);
r = min(r, c3 + sa);
r = min(r, c3 + sb);
r = min(r, sa + sb);
printf("%d", r);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
int ans1 = 1000 * 1000 * 1000;
int ans2 = 1000 * 1000 * 1000;
int sum1 = 0, sum2 = 0;
int q1 = 0;
int q2 = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x * c1 > c2)
q1++;
else
sum1 += x;
}
for (int j = 0; j < m; j++) {
int x;
cin >> x;
if (x * c1 > c2)
q2++;
else
sum2 += x;
}
ans1 = min(ans1, c3);
ans1 = min(ans1, sum1 * c1 + q1 * c2);
ans2 = min(ans2, c3);
ans2 = min(ans2, sum2 * c1 + q2 * c2);
cout << min(ans1 + ans2, c4);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long infLL = 0x3f3f3f3f3f3f3f3fLL;
const int hash_mod = 1000037;
const double pi = acos(-1);
const double eps = 1e-10;
const int maxn = 1000 + 5;
int n, m;
int a[maxn], b[maxn];
int c[4];
int calc(int a[], int n) {
int res = 0;
for (int i = 0; i < n; ++i) res += min(a[i] * c[0], c[1]);
return min(res, c[2]);
}
int main() {
for (int i = 0; i < 4; ++i) scanf("%d", &c[i]);
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
for (int i = 0; i < m; ++i) scanf("%d", &b[i]);
printf("%d\n", min(calc(a, n) + calc(b, m), c[3]));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long c1, c2, c3, c4;
while (cin >> c1 >> c2 >> c3 >> c4) {
long a[100000] = {0}, cp[10] = {0}, x, b[100000] = {0}, n, m, k = 1,
c[10000] = {0};
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
c[0] = c3;
for (int i = 0; i < n; i++) {
x = a[i];
cp[0] = x * c1;
cp[1] = c2;
sort(cp, cp + 2);
c[1] = c[1] + cp[0];
}
long m1[10000] = {0}, mm[10000] = {0};
sort(c, c + 2);
mm[0] = c[0];
c[0] = c3;
c[1] = 0;
for (int i = 0; i < m; i++) {
x = b[i];
cp[0] = x * c1;
cp[1] = c2;
sort(cp, cp + 2);
c[1] = c[1] + cp[0];
}
sort(c, c + 2);
mm[1] = c[0];
m1[0] = mm[0] + mm[1];
m1[1] = c4;
m1[2] = c3 * 2;
sort(m1, m1 + 3);
cout << m1[0] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, c1, c2, c3, c4;
const int maxN = 1e3 + 10;
int a[maxN], b[maxN];
int main() {
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++) cin >> b[i];
int sum1 = 0;
for (int i = 1; i <= n; i++)
if (a[i] * c1 < c2)
sum1 += a[i] * c1;
else
sum1 += c2;
if (sum1 > c3) sum1 = c3;
int sum2 = 0;
for (int i = 1; i <= m; i++)
if (b[i] * c1 < c2)
sum2 += b[i] * c1;
else
sum2 += c2;
if (sum2 > c3) sum2 = c3;
if (sum2 + sum1 < c4)
cout << sum2 + sum1;
else
cout << c4;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i = 0, j = 0, cs = 0, in;
int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
vector<int> b(n), t(m);
bool x = 0, y = 0;
for (i = 0; i < n; i++) {
cin >> b[i];
if (b[i]) x = 1;
}
for (i = 0; i < m; i++) {
cin >> t[i];
if (t[i]) y = 1;
}
long long ans = 0;
if (x || y) ans = c4;
if (x && y) ans = min(c4, 2 * c3);
if ((!x && y) || (x && !y)) ans = min(c4, c3);
long long para = 0;
if (x) para = c3;
for (i = 0; i < m; i++) {
long long lol = min(c2, t[i] * c1);
para += lol;
}
ans = min(para, ans);
para = 0;
if (y) para = c3;
for (i = 0; i < n; i++) {
long long lol = min(c2, b[i] * c1);
para += lol;
}
ans = min(ans, para);
para = 0;
for (i = 0; i < n; i++) {
para += min(c2, b[i] * c1);
}
for (i = 0; i < m; i++) {
para += min(c2, t[i] * c1);
}
ans = min(ans, para);
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int c1, c2, c3, c4, n, m, i, j, sum1 = 0, sum2 = 0, sum;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
int a[n], b[m];
for (i = 0; i <= n - 1; i++) {
cin >> a[i];
sum1 = sum1 + min(a[i] * c1, c2);
}
sum1 = min(sum1, c3);
for (i = 0; i <= m - 1; i++) {
cin >> b[i];
sum2 = sum2 + min(b[i] * c1, c2);
}
sum2 = min(sum2, c3);
sum = min(sum1 + sum2, c4);
cout << sum << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int solve(vector<int> &v, int a, int b) {
int ans = 0;
for (int i = 0; i < ((int)(v).size()); i++) ans += min(v[i] * a, b);
return ans;
}
int main() {
ios_base ::sync_with_stdio(0);
int c1, c2, c3, c4;
while (cin >> c1 >> c2 >> c3 >> c4) {
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
int ans = c4;
ans = min(ans, 2 * c3);
int v1 = solve(a, c1, c2);
int v2 = solve(b, c1, c2);
ans = min(ans, v1 + v2);
ans = min(ans, v1 + c3);
ans = min(ans, v2 + c3);
printf("%d\n", ans);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
int n, m, a, sa, sb, lmin;
while (cin >> c1 >> c2 >> c3 >> c4) {
cin >> n >> m;
lmin = sa = sb = 0;
for (int i = 0; i < n; i++) {
cin >> a;
sa += min(a * c1, c2);
}
for (int i = 0; i < m; i++) {
cin >> a;
sb += min(a * c1, c2);
}
sa = min(sa, c3), sb = min(sb, c3);
lmin = min(sa + sb, min(2 * c3, c4));
cout << lmin << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> buses, trolleys;
int c1, c2, c3, c4, allBus = 0, allTrolley = 0;
cin >> c1 >> c2 >> c3 >> c4;
int n, m, input;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> input;
buses.push_back(input);
allBus += input;
}
for (int i = 0; i < m; i++) {
cin >> input;
trolleys.push_back(input);
allTrolley += input;
}
int mins1, mins2;
for (int i = 0; i < buses.size(); i++) {
if (i == 0)
mins1 = min(buses[i] * c1, c2);
else
mins1 += min(buses[i] * c1, c2);
}
if (mins1 > c3) {
mins1 = c3;
}
for (int i = 0; i < trolleys.size(); i++) {
if (i == 0)
mins2 = min(trolleys[i] * c1, c2);
else
mins2 += min(trolleys[i] * c1, c2);
}
if (mins2 > c3) {
mins2 = c3;
}
if (mins1 + mins2 > c4) {
cout << c4 << endl;
} else {
cout << mins1 + mins2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
int c[4];
cin >> c[0] >> c[1] >> c[2] >> c[3];
int n, m;
cin >> n >> m;
int b[n + 1], t[m + 1];
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < m; i++) {
cin >> t[i];
}
int sum1 = 0, sum2 = 0;
for (int i = 0; i < n; i++) {
sum1 += min(c[1], c[0] * b[i]);
}
for (int i = 0; i < m; i++) {
sum2 += min(c[1], c[0] * t[i]);
}
cout << min(c[3],
min(c[2] + sum1, min(c[2] + sum2, min(c[2] * 2, sum1 + sum2))))
<< endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4, n, m;
int rs1, rs2, rs3, rs4, rs;
int a, b;
int main() {
ios_base::sync_with_stdio(0);
;
cin.tie(0);
;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a;
rs1 += min(a * c1, c2);
}
rs2 = min(rs1, c3);
for (int i = 1; i <= m; i++) {
cin >> b;
rs3 += min(b * c1, c2);
}
rs4 = min(rs3, c3);
cout << min(rs2 + rs4, c4);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1001];
int b[1001];
int main() {
int c1, c2, c3, c4, n, m;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++) cin >> b[i];
int suma = 0;
for (int i = 1; i <= n; i++) {
if (c2 >= c1 * a[i])
suma = suma + c1 * a[i];
else
suma = suma + c2;
}
if (suma > c3) suma = c3;
int sumb = 0;
for (int i = 1; i <= m; i++) {
if (c2 >= c1 * b[i])
sumb = sumb + c1 * b[i];
else
sumb = sumb + c2;
}
if (sumb > c3) sumb = c3;
if (suma + sumb > c4)
cout << c4 << endl;
else
cout << suma + sumb << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
unordered_map<long long int, long long int> po;
int main() {
int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
int a[n];
int b[m];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
sort(b, b + m);
int cost = c2 * n;
int nr = 0;
for (int i = 0; i < n; i++) {
nr += a[i];
cost = min(cost, (c1 * nr + c2 * (n - i - 1)));
}
int rate = c2 * m;
nr = 0;
for (int i = 0; i < m; i++) {
nr += b[i];
rate = min(rate, (c1 * nr + c2 * (m - i - 1)));
}
c4 = min(c4, (cost + rate));
int r = min((c3 + cost), (c3 + rate));
c4 = min(c4, r);
c4 = min(c4, 2 * c3);
c4 = min(c4, (n + m) * c2);
cout << c4;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int vis[10000 + 1];
int t, x, y;
int bus[1111], trolley[1111];
int main() {
ios_base::sync_with_stdio(0);
cout.precision(15);
cout << fixed;
cout.tie(0);
cin.tie(0);
int c1, c2, c3, c4;
int n, m;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
int x;
for (int(i) = 0; (i) < (n); (i)++) {
cin >> bus[i];
}
for (int(i) = 0; (i) < (m); (i)++) {
cin >> trolley[i];
}
int s = 0;
for (int(i) = 0; (i) < (n); (i)++) {
s += min(bus[i] * c1, c2);
}
s = min(s, c3);
int st = 0;
for (int(i) = 0; (i) < (m); (i)++) {
st += min(trolley[i] * c1, c2);
}
st = min(st, c3);
cout << min(c4, st + s) << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
const int inf = 0xfffffff;
int x[maxn], y[maxn];
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int n, m;
cin >> n >> m;
int s1 = 0, s2 = 0;
for (int i = 0; i < n; ++i) {
cin >> x[i];
s1 += min(x[i] * a, b);
}
s1 = min(s1, c);
for (int i = 0; i < m; ++i) {
cin >> y[i];
s2 += min(y[i] * a, b);
}
s2 = min(s2, c);
cout << min(d, s1 + s2) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4;
int n, m;
int a[1007];
int b[1007];
int times1[1007];
int times2[1007];
int sm1 = 0;
int sm2 = 0;
void input();
void solve();
int main() {
input();
solve();
return 0;
}
void input() {
scanf("%d%d%d%d", &c1, &c2, &c3, &c4);
int i;
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
sm1 += a[i];
}
for (i = 0; i < m; i++) {
scanf("%d", &b[i]);
sm2 += b[i];
}
}
void solve() {
int ans = c4;
int s = 0;
int s1 = 0;
int i;
for (i = 0; i < n; i++) {
if (a[i] * c1 < c2) {
s += a[i] * c1;
} else
s += c2;
}
for (i = 0; i < m; i++) {
if (b[i] * c1 < c2) {
s1 += b[i] * c1;
} else
s1 += c2;
}
if (s > c3) s = c3;
if (s1 > c3) s1 = c3;
if (ans > s + s1) ans = s + s1;
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long c1, c2, c3, c4, n, m, b[1005], t[1005], sum_b, sum_t, ans, temp;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
sum_b = sum_t = 0;
for (long long i = 0; i < n; i++) {
cin >> b[i];
sum_b += b[i];
}
for (long long i = 0; i < m; i++) {
cin >> t[i];
sum_t += t[i];
}
ans = c4;
ans = min(ans, c3 * 2);
temp = c3;
for (long long i = 0; i < n; i++) {
temp += min(b[i] * c1, c2);
}
ans = min(ans, temp);
temp = c3;
for (long long i = 0; i < m; i++) {
temp += min(t[i] * c1, c2);
}
ans = min(ans, temp);
temp = 0;
for (long long i = 0; i < n; i++) {
temp += min(b[i] * c1, c2);
}
for (long long i = 0; i < m; i++) {
temp += min(t[i] * c1, c2);
}
ans = min(ans, temp);
temp = (sum_b + sum_t) * c1;
ans = min(ans, temp);
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
int a[1010];
int b[1010];
int vis[1010];
int dp1[1010];
int dp2[1010];
int main() {
int n, m, c1, c2, c3, c4, ans1, ans2, i, j, p1, p2;
while (scanf("%d%d%d%d", &c1, &c2, &c3, &c4) != EOF) {
scanf("%d%d", &n, &m);
memset(vis, 0, sizeof(vis));
ans1 = ans2 = 0;
p1 = 0;
p2 = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
dp1[i] = c2;
if (a[i] * c1 < c2) {
dp1[i] = a[i] * c1;
}
p1 = p1 + dp1[i];
}
if (p1 > c3) p1 = c3;
for (i = 0; i < m; i++) {
scanf("%d", &b[i]);
dp2[i] = c2;
if (b[i] * c1 < c2) {
dp2[i] = b[i] * c1;
}
p2 = p2 + dp2[i];
}
if (p2 > c3) p2 = c3;
if (p1 + p2 < c4) c4 = p1 + p2;
printf("%d\n", c4);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int T, i, j;
int n, m;
int a[1000000 + 10], b[1000000 + 10];
vector<int> w;
int ans;
int flag;
int mii, maa;
int miib;
int k, d;
int l;
int count1, count2, count3, count4, count6, c24, c63;
typedef struct {
int v;
int in;
int ch;
} Point;
Point p[1000000 + 10], P2[1000000 + 10], P3[1000000 + 10], P4[1000000 + 10];
int Py[1000000 + 10], Pz[1000000 + 10], Ps[1000000 + 10], Px[1000000 + 10];
int c1, c2, c3, c4;
int cs, cx, cz, cy;
int sum1, sum2;
int sum;
int temp;
int lft;
int cca, ccb;
int main(void) {
while (scanf("%d", &c1) == 1) {
ccb = 0;
cca = 0;
ans = 0;
sum1 = 0;
sum2 = 0;
scanf("%d", &c2);
scanf("%d", &c3);
scanf("%d", &c4);
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum1 += ((c2) < (c1 * a[i]) ? (c2) : (c1 * a[i]));
}
for (i = 0; i < m; i++) {
scanf("%d", &b[i]);
sum2 += ((c2) < (c1 * b[i]) ? (c2) : (c1 * b[i]));
}
sum1 = ((sum1) < (c3) ? (sum1) : (c3));
sum2 = ((sum2) < (c3) ? (sum2) : (c3));
ans = ((c4) < (sum1 + sum2) ? (c4) : (sum1 + sum2));
printf("%d\n", ans);
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.