text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
int dx8[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy8[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dxH[] = {2, 2, -2, -2, 1, 1, -1, -1};
int dyH[] = {1, -1, 1, -1, 2, -2, 2, -2};
const double GRS = (1 + sqrt(5)) / 2;
template <typename T>
T power(T X, T P) {
T ans = (T)1;
for (T i = 1; i <= P; i++) {
ans = ans * X;
}
return ans;
}
template <typename T>
T ABS(T A, T B) {
T ret = A - B;
if (ret < 0) return -ret;
return ret;
}
long long MOD = 1000000007;
const long long BIGMAX = power(2, 63) - 1;
template <typename T>
T ADD(T X, T Y, T M) {
if (X + Y < 0)
return (X - M) + Y;
else if (X + Y >= M)
return X + Y - M;
else
return X + Y;
}
template <typename T>
T prod(T a, T b, T c) {
T x = 0, y = a % c;
while (b > 0) {
if (b % 2 == 1) {
x = ADD(x, y, c);
}
y = (y * 2) % c;
b /= 2;
}
return x % c;
}
template <typename T>
T bigmod(T a, T b) {
T x = 1, y = a % MOD;
while (b > 0) {
if (b % 2 == 1) {
x = prod(x, y, MOD);
}
y = prod(y, y, MOD);
b /= (long long)2;
}
return x;
}
template <typename T>
T MODINVERSE(T a) {
return bigmod(a, MOD - 2);
}
template <typename T>
T GCD(T x, T y) {
while (y != 0) {
T z = x % y;
x = y;
y = z;
}
return x;
}
bool isvowel(char ch) {
ch = toupper(ch);
if (ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U' ||
ch == 'Y')
return true;
return false;
}
long long first[1234], second[1234];
int main() {
long long c1, c2, c3, c4;
scanf("%lld %lld %lld %lld", &c1, &c2, &c3, &c4);
int bus, trolly;
scanf("%d %d", &bus, &trolly);
long long c4cost = c4;
for (int i = 1; i <= bus; i++) {
scanf("%lld", first + i);
}
sort(first + 1, first + bus + 1);
for (int i = 1; i <= trolly; i++) {
scanf("%lld", second + i);
}
sort(second + 1, second + trolly + 1);
long long bus_cost = c3, trolly_cost = c3;
long long cnt_bus = 0, cnt_trolly = 0;
for (int i = 0; i <= bus; i++) {
long long cost = (cnt_bus + first[i]) * c1 + (bus - i) * c2;
bus_cost = min(bus_cost, cost);
cnt_bus += first[i];
}
for (int i = 0; i <= trolly; i++) {
long long cost = (cnt_trolly + second[i]) * c1 + (trolly - i) * c2;
trolly_cost = min(trolly_cost, cost);
cnt_trolly += second[i];
}
printf("%lld", min(c4cost, bus_cost + trolly_cost));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c[4];
int a[1000], b[1000], bus, tro;
int m, n, i, j, k;
for (i = 0; i < 4; i++) {
scanf("%d", &c[i]);
}
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
bus = tro = 0;
for (i = 0; i < n; i++) {
bus += (((c[0] * a[i]) < (c[1])) ? (c[0] * a[i]) : (c[1]));
}
for (i = 0; i < m; i++) {
tro += (((c[0] * b[i]) < (c[1])) ? (c[0] * b[i]) : (c[1]));
}
if (bus > c[2]) {
bus = c[2];
}
if (tro > c[2]) {
tro = c[2];
}
printf("%d\n", (((bus + tro) < (c[3])) ? (bus + tro) : (c[3])));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, i, j, k, m, n, t1 = 0, t2 = 0, a, b;
cin >> c1 >> c2 >> c3 >> c4;
cin >> m >> n;
for (i = 0; i < m; i++) {
cin >> a;
t1 += min(a * c1, c2);
}
for (i = 0; i < n; i++) {
cin >> b;
t2 += min(b * c1, c2);
}
t1 = min(t1, c3);
t2 = min(t2, c3);
int ans = min(t1 + t2, c4);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
int a[maxn], b[maxn];
int main() {
int c1, c2, c3, c4;
scanf("%d%d%d%d", &c1, &c2, &c3, &c4);
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= m; i++) {
scanf("%d", &b[i]);
}
int ans = c4;
ans = min(ans, c3 * 2);
ans = min(ans, c2 * (n + m));
int res = 0;
for (int i = 1; i <= n; i++) {
res += min(c1 * a[i], c2);
}
int cnt = min(res, c3);
res = 0;
for (int i = 1; i <= m; i++) {
res += min(c1 * b[i], c2);
}
cnt += min(res, c3);
ans = min(ans, cnt);
cout << ans << endl;
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 B[n];
int T[m];
int i;
for (i = 0; i < n; i++) {
scanf("%d", &B[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &T[i]);
}
long int sum1 = 0, sum2 = 0;
for (i = 0; i < n; i++) {
if ((B[i] * c1) < c2) {
sum1 = sum1 + (B[i] * c1);
} else {
sum1 = sum1 + c2;
}
}
if (sum1 > c3) {
sum1 = c3;
}
for (i = 0; i < m; i++) {
if ((T[i] * c1) < c2) {
sum2 = sum2 + (T[i] * c1);
} else {
sum2 = sum2 + c2;
}
}
if (sum2 > c3) {
sum2 = c3;
}
if ((sum1 + sum2) > c4) {
printf("%d", c4);
} else
printf("%ld", sum1 + sum2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c[4], b[1009], t[1009], s1 = 0, s2 = 0, s = 0, sb = 0, st = 0;
for (int i = 0; i < 4; i++) cin >> c[i];
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> b[i];
sb += min(b[i] * c[0], c[1]);
s1 += b[i];
}
for (int i = 0; i < m; i++) {
cin >> t[i];
st += min(t[i] * c[0], c[1]);
s1 += t[i];
}
s = min(sb, c[2]) + min(st, c[2]);
s = min(s, c[3]);
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c_1, c_2, c_3, c_4;
int n_1, n_2;
cin >> c_1 >> c_2 >> c_3 >> c_4 >> n_1 >> n_2;
int a[n_1], b[n_2];
int sum_a = 0;
int sum_b = 0;
for (int i = 0; i < n_1; i++) {
cin >> a[i];
a[i] = min(a[i] * c_1, c_2);
sum_a += a[i];
}
for (int i = 0; i < n_2; i++) {
cin >> b[i];
b[i] = min(b[i] * c_1, c_2);
sum_b += b[i];
}
sum_a = min(sum_a, c_3);
sum_b = min(sum_b, c_3);
int ans = 0;
ans = min((sum_a + sum_b), c_4);
cout << ans;
}
|
#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 w;
int sum1 = 0;
int sum2 = 0;
while (n--) {
scanf("%d", &w);
sum1 += min(w * c1, c2);
}
while (m--) {
scanf("%d", &w);
sum2 += min(w * c1, c2);
}
int ret = min(c4, c3 << 1);
ret = min(c3 + min(sum1, sum2), ret);
ret = min(sum1 + sum2, ret);
printf("%d\n", ret);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int infint = INT_MAX;
const long long infll = LLONG_MAX;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
vector<int> arr[2];
int s1 = 0, s2 = 0;
int pf = 0, ps = 0;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
pf += min(k * c1, c2);
arr[0].push_back(k);
s1 += k;
}
pf = min(pf, c3);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
ps += min(k * c1, c2);
arr[1].push_back(k);
s2 += k;
}
ps = min(ps, c3);
cout << min(ps + pf, c4);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
int res = 0;
while (n && ++res) n -= n & (-n);
return res;
}
const int PI = 3.1415926535897932384626;
const long long int MAX = 1000000000 + 7;
int main() {
long long int t1, t2, t3, t4;
scanf("%lld", &t1);
scanf("%lld", &t2);
scanf("%lld", &t3);
scanf("%lld", &t4);
long long int nb, nt;
scanf("%lld", &nb);
scanf("%lld", &nt);
long long int b[nb + 3];
for (long long int i = 0; i < nb; i++) {
scanf("%lld", &b[i]);
}
long long int t[nt + 3];
for (long long int i = 0; i < nt; i++) {
scanf("%lld", &t[i]);
}
long long int sum1 = 0;
long long int sum2 = t3;
for (long long int i = 0; i < nb; i++) {
if ((b[i] * t1) < t2)
sum1 += (b[i] * t1);
else
sum1 += t2;
}
if (sum1 > sum2) sum1 = sum2;
long long int sum3 = 0;
for (long long int i = 0; i < nt; i++) {
if ((t[i] * t1) < t2)
sum3 += (t[i] * t1);
else
sum3 += t2;
}
if (sum3 > sum2) sum3 = sum2;
sum1 += sum3;
if (sum1 > t4) sum1 = t4;
printf("%lld", sum1);
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1500000000;
const int MOD = 1000000007;
const int HASH = 137;
const int NUM = 1100;
const double pi = 3.141592653589793238;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long C[5];
for (long long i = 1; i <= 4; i++) cin >> C[i];
long long N, M;
cin >> N >> M;
long long bus[N], trolley[M];
for (long long i = 0; i < N; i++) cin >> bus[i];
for (long long i = 0; i < M; i++) cin >> trolley[i];
long long ans = INF;
ans = min(ans, C[4]);
ans = min(ans, 2 * C[3]);
long long bus_min = 0, trolley_min = 0;
for (long long i = 0; i < N; i++) bus_min += min(C[1] * bus[i], C[2]);
for (long long i = 0; i < M; i++) trolley_min += min(C[1] * trolley[i], C[2]);
ans = min(ans, C[3] + min(bus_min, trolley_min));
ans = min(ans, bus_min + trolley_min);
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int t = 1;
while (t--) {
long long int c1, c2, c3, c4;
long long int n, m;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
long long int ans = 0;
for (long long int i = 0; i < n; i++) {
long long int x = 0;
cin >> x;
if (x * c1 < c2)
ans += x * c1;
else
ans += c2;
}
ans = min(c3, ans);
long long int ans2 = 0;
for (long long int i = 0; i < m; i++) {
long long int x = 0;
cin >> x;
if (x * c1 < c2)
ans2 += x * c1;
else
ans2 += c2;
}
ans2 = min(ans2, c3);
ans = min(c4, ans + ans2);
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long tonum(const string &s) {
stringstream ss;
ss << s;
long long x;
ss >> x;
return x;
}
string tostring(long long number) {
stringstream ss;
ss << number;
return ss.str();
}
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
if (a.first < b.first)
return false;
else if (a.first > b.first)
return true;
return a.second > b.second;
}
bool comp2(long long a, long long b) { return a > b; }
long long a, b, c, d, n, m;
long long func(long long *arr, long long len) {
long long sum = 0;
for (int i = 0; i < len; i++) sum += arr[i];
sum = sum * a;
long long sum2 = len * b;
sort(arr, arr + len);
long long j = len - 1;
long long sum3 = 0;
while (j >= 0) {
if (arr[j] * a > b)
j--, sum3 += b;
else {
for (int k = 0; k <= j; k++) sum3 += arr[k] * a;
break;
}
}
return min(c, min(sum, min(sum2, sum3)));
}
int main() {
scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
scanf("%lld%lld", &n, &m);
long long arr[n], arr2[m];
for (int i = 0; i < n; i++) scanf("%lld", &arr[i]);
for (int i = 0; i < m; i++) scanf("%lld", &arr2[i]);
printf("%lld\n", min(d, func(arr, n) + func(arr2, m)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long c1, c2, c3, c4, n, m, x;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
long a = 0, b = 0;
for (long i = 0; i < n; i++) {
cin >> x;
x = min(c1 * x, c2);
a = a + x;
}
for (long i = 0; i < m; i++) {
cin >> x;
x = min(c1 * x, c2);
b = b + x;
}
a = min(a, c3);
b = min(b, c3);
long ans = min(a + b, c4);
printf("%ld\n", ans);
}
|
#include <bits/stdc++.h>
int main() {
int c1, c2, c3, c4, count = 0, a[1000], m, n, i, final = 0;
scanf("%d %d %d %d", &c1, &c2, &c3, &c4);
scanf("%d %d", &n, &m);
for (i = 0; i < n; ++i) {
scanf("%d", &a[i]);
count += ((a[i] * c1) > c2) ? c2 : (a[i] * c1);
}
final += (count > c3) ? c3 : count;
count = 0;
for (i = 0; i < m; ++i) {
scanf("%d", &a[i]);
count += ((a[i] * c1) > c2) ? c2 : (a[i] * c1);
}
final += (count > c3) ? c3 : count;
if (final > c4) final = c4;
printf("%d", final);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1100];
int b[1100];
int main() {
int c1, c2, c3, c4;
int n, m;
while (cin >> c1 >> c2 >> c3 >> c4) {
cin >> n >> m;
int tmp1 = 0;
int tmp2 = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
tmp1 += min(a[i] * c1, c2);
}
for (int i = 1; i <= m; i++) {
scanf("%d", &b[i]);
tmp2 += min(b[i] * c1, c2);
}
if (tmp2 > c3) tmp2 = c3;
if (tmp1 > c3) tmp1 = c3;
if (tmp2 + tmp1 > c4) tmp1 = 0, tmp2 = c4;
cout << (tmp1 + tmp2) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, a, b, c, d, x, y, n, m;
int ans = 0, sum = 0;
scanf("%d %d %d %d", &a, &b, &c, &d);
scanf("%d %d", &n, &m);
for (i = 0; i < n; i++) {
scanf("%d", &x);
if (x * a < b)
ans += (x * a);
else
ans += b;
}
if (ans > c) ans = c;
for (i = 0; i < m; i++) {
scanf("%d", &x);
if (x * a < b)
sum += (x * a);
else
sum += b;
}
if (sum > c) sum = c;
ans = ans + sum;
if (ans > 2 * c) ans = 2 * c;
if (ans > d) ans = d;
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, b, t;
cin >> c1 >> c2 >> c3 >> c4;
cin >> b >> t;
int bus[10000], trolley[10000];
for (int i = 0; i < b; i++) cin >> bus[i];
for (int i = 0; i < t; i++) cin >> trolley[i];
int x = 0;
int costbus = 0;
for (int i = 0; i < b; i++) {
costbus += min(bus[i] * c1, c2);
}
costbus = min(costbus, c3);
int costtrolley = 0;
for (int i = 0; i < t; i++) {
costtrolley += min(trolley[i] * c1, c2);
}
costtrolley = min(costtrolley, c3);
cout << min(costtrolley + costbus, c4);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, l, m, n;
int T, M, N, K, t1, t2, t3, t4, t5, D;
long long ans, out;
cin >> t1 >> t2 >> t3 >> t4;
cin >> N >> M;
int troll = 0, bus = 0;
for (i = 0; i < N; ++i) {
cin >> k;
bus += min(k * t1, t2);
}
bus = min(bus, t3);
for (i = 0; i < M; ++i) {
cin >> k;
troll += min(k * t1, t2);
}
troll = min(troll, t3);
cout << min(t4, bus + troll) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MAX_I = 1000;
long long a[MAX_I + 1];
long long b[MAX_I + 1];
int main() {
long long n, m;
long long c[5];
long long tmp;
long long asum = 0;
long long bsum = 0;
cin >> c[1] >> c[2] >> c[3] >> c[4];
cin >> n >> m;
for (long long i = 0; i < n; ++i) {
cin >> tmp;
a[i] = min(c[2], c[1] * tmp);
asum += a[i];
}
for (long long i = 0; i < m; ++i) {
cin >> tmp;
b[i] = min(c[2], c[1] * tmp);
bsum += b[i];
}
asum = min(asum, c[3]);
bsum = min(bsum, c[3]);
cout << min(asum + bsum, c[4]) << 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 a[n];
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
int b[m];
for (int i = 0; i < m; i++) scanf("%d", &b[i]);
int t1 = 0;
for (int i = 0; i < n; i++) t1 += min(a[i] * c1, c2);
int t2 = 0;
for (int i = 0; i < m; i++) t2 += min(b[i] * c1, c2);
cout << min(min(t1, c3) + min(t2, c3), c4) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
long long ans1 = 0, ans2 = 0, ans = 0, c1, c2, c3, c4, n, m, ln[1001],
lm[1001];
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
for (int i = 0; i < n; i++) {
cin >> ln[i];
ans1 += min(c2, (c1 * ln[i]));
}
for (int i = 0; i < m; i++) {
cin >> lm[i];
ans2 += min(c2, (c1 * lm[i]));
}
if (ans1 > c3) ans1 = c3;
if (ans2 > c3) ans2 = c3;
if (ans1 + ans2 > c4)
ans = c4;
else
ans = ans1 + ans2;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
bool rev(pair<long long int, long long int> &a,
pair<long long int, long long int> &b) {
return a.first < b.first || (a.first == b.first && a.second > b.second);
}
const long long int maxn = 1000 + 5, inf = 1e18;
void test() {
long long int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
long long int n, m;
cin >> n >> m;
long long int a[n];
long long int b[m];
for (long long int i = 0; i < n; ++i) cin >> a[i];
for (long long int i = 0; i < m; ++i) cin >> b[i];
long long int bs = inf, k = 0;
for (long long int i = 0; i < n; ++i) k += min(c1 * a[i], c2);
bs = min(bs, min(k, c3));
long long int tr = inf;
k = 0;
for (long long int i = 0; i < m; ++i) k += min(c1 * b[i], c2);
tr = min(tr, min(k, c3));
cout << min(bs + tr, c4) << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t = 1;
while (t--) test();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int OO = (int)2e9;
const double eps = 1e-9;
int main() {
long long c1, c2, c3, c4, n, m, i, ret, b = 0, c = 0, t1 = 0, t2 = 0;
long long bus[1001], car[1001];
long long sumb = 0, sumc = 0;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
ret = c4;
for ((i) = 0; (i) < (n); (i)++) cin >> bus[i], sumb += bus[i];
for ((i) = 0; (i) < (m); (i)++) cin >> car[i], sumc += car[i];
sort(bus, bus + n);
sort(car, car + m);
b = min(c3, sumb * c1);
b = min(b, n * c2);
for ((i) = 0; (i) < (n); (i)++) {
t1 += bus[i];
b = min(b, t1 * c1 + (n - i - 1) * c2);
}
c = min(c3, sumc * c1);
c = min(c, m * c2);
for ((i) = 0; (i) < (m); (i)++) {
t2 += car[i];
c = min(c, t2 * c1 + (m - i - 1) * c2);
}
ret = min(ret, b + c);
cout << ret << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
unsigned long long int c[4];
for (int i = 0; i < 4; i++) cin >> c[i];
unsigned long long int n, m;
cin >> n >> m;
vector<unsigned long long int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<unsigned long long int> b(m);
for (int j = 0; j < m; j++) cin >> b[j];
unsigned long long int ans_a = 0;
for (int i = 0; i < n; i++) {
if (a[i] * c[0] < c[1])
ans_a += a[i] * c[0];
else
ans_a += c[1];
}
if (ans_a > c[2]) ans_a = c[2];
unsigned long long int ans_b = 0;
for (int i = 0; i < m; i++) {
if (b[i] * c[0] < c[1])
ans_b += b[i] * c[0];
else
ans_b += c[1];
}
if (ans_b > c[2]) ans_b = c[2];
if ((ans_a + ans_b) < c[3])
cout << ans_a + ans_b << endl;
else
cout << c[3] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c[4], n, m;
int a[1010], b[1010], ans;
int main() {
for (int i = 0; i < 4; i++) cin >> c[i];
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
ans = c[3];
int s1 = 0, s2 = 0;
for (int i = 0; i < n; i++)
if (a[i] * c[0] < c[1])
s1 += a[i] * c[0];
else
s1 += c[1];
for (int i = 0; i < m; i++)
if (b[i] * c[0] < c[1])
s2 += b[i] * c[0];
else
s2 += c[1];
s1 = min(s1, c[2]);
s2 = min(s2, c[2]);
ans = min(ans, s1 + s2);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int types[4];
int main() {
for (int i = 0; i < 4; i++) cin >> types[i];
int n, m, a, c = 0, d = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a, c += min(a * types[0], types[1]);
c = min(c, types[2]);
for (int i = 0; i < m; i++) cin >> a, d += min(a * types[0], types[1]);
d = min(d, types[2]);
cout << min(types[3], c + d);
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, a, b, c, d, res, buss[1001], trolley[1001], izq, der;
int main() {
scanf("%I64d %I64d %I64d %ld %I64d %I64d", &a, &b, &c, &d, &n, &m);
for (int i = 0; i < n; i++) scanf("%I64d", &buss[i]);
for (int i = 0; i < m; i++) scanf("%I64d", &trolley[i]);
for (int i = 0; i < n; i++) izq += min(b, a * buss[i]);
for (int i = 0; i < m; i++) der += min(b, a * trolley[i]);
res = min(d, c + c);
res = min(res, c + izq);
res = min(res, c + der);
res = min(res, izq + der);
printf("%I64d", res);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
int n, m;
int sumn = 0, summ = 0;
scanf("%d %d %d %d", &c1, &c2, &c3, &c4);
scanf("%d %d", &n, &m);
for (int i = 0; i < n; ++i) {
int a;
scanf("%d", &a);
sumn += min(a * c1, c2);
}
for (int i = 0; i < m; ++i) {
int b;
scanf("%d", &b);
summ += min(b * c1, c2);
}
printf("%d\n", min(min(sumn, c3) + min(summ, c3), c4));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
int m, n;
int i, j;
int s1, s2;
scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &m, &n);
for (i = 0, s1 = 0; i < m; i++) {
scanf("%d", &j);
if (j * a < b)
s1 += j * a;
else
s1 += b;
}
if (s1 > c) s1 = c;
for (i = 0, s2 = 0; i < n; i++) {
scanf("%d", &j);
if (j * a < b)
s2 += j * a;
else
s2 += b;
}
if (s2 > c) s2 = c;
if (s1 + s2 < d)
printf("%d", s1 + s2);
else
printf("%d", d);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
int n, m, s = 0;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
vector<int> a(n), t(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i] * c1;
}
for (int i = 0; i < m; i++) {
cin >> t[i];
s += t[i] * c1;
}
int mn = s;
s = 0;
for (int i = 0; i < n; i++) s += min(a[i] * c1, c2);
int sa = s;
for (int i = 0; i < m; i++) s += min(t[i] * c1, c2);
int st = s - sa;
mn = min(mn, s);
sa = min(sa, c3), st = min(st, c3);
mn = min(sa + st, mn);
cout << min(mn, c4);
}
|
#include <bits/stdc++.h>
using namespace std;
long long powi(long long base, int p) {
long long res = 1;
while (p--) res *= base;
return res;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
bool is_vowel(char c) {
c = tolower(c);
return c == 'a' || c == 'e' || c == 'o' || c == 'i' || c == 'u' || c == 'y';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
int aa = 0, bb = 0;
for (int i = 0, a; i < n; i++) {
cin >> a;
if (a * c1 < c2)
aa += a * c1;
else
aa += c2;
}
aa = min(aa, c3);
for (int i = 0, b; i < m; i++) {
cin >> b;
if (b * c1 < c2)
bb += b * c1;
else
bb += c2;
}
bb = min(bb, c3);
cout << min(aa + bb, c4);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int mas1[2000];
int mas2[2000];
vector<int> arr;
int main() {
int n, m, c1, c2, c3, c4;
long long m1 = 0, m11 = 0, m2, m3, m4, m5, m6, res;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
m4 = c4;
m3 = c3 * 2;
for (int i = 0; i < n; i++) {
cin >> mas1[i];
m1 += min(mas1[i] * c1, c2);
}
for (int i = 0; i < m; i++) {
cin >> mas2[i];
m11 += min(mas2[i] * c1, c2);
}
res = min(min(m1 + m11, min(m1 + c3, m11 + c3)), min(m3, m4));
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4;
int a[1111], b[1111];
int n, m;
int main() {
while (cin >> c1 >> c2 >> c3 >> c4) {
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
int mi = min(c4, 2 * c3);
int nm = c3;
for (int i = 0; i < n; i++) nm += min(c1 * a[i], c2);
mi = min(mi, nm);
nm = c3;
for (int i = 0; i < m; i++) nm += min(c1 * b[i], c2);
mi = min(mi, nm);
nm = 0;
for (int i = 0; i < n; i++) nm += min(c1 * a[i], c2);
for (int i = 0; i < m; i++) nm += min(c1 * b[i], c2);
mi = min(mi, nm);
cout << mi << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int c1, c2, c3, c4;
long long int func(long long int num, long long int a[]) {
long long int sum = 0;
for (long long int i = 0; i < num; i++) {
sum += min(c2, a[i] * c1);
}
return min(sum, c3);
}
int32_t main() {
long long int t;
t = 1;
while (t--) {
cin >> c1 >> c2 >> c3 >> c4;
long long int n, m;
cin >> n >> m;
long long int a[n], b[m];
for (long long int i = 0; i < n; i++) {
cin >> a[i];
}
for (long long int i = 0; i < m; i++) {
cin >> b[i];
}
cout << min(c4, func(n, a) + func(m, b));
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1005], b[1005];
int main() {
int c1, c2, c3, c4, n, m, i, j, k, l;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
int ans1 = 0, ans2 = 0;
for (i = 1; i <= n; i++) {
cin >> a[i];
ans1 += min(a[i] * c1, c2);
}
ans1 = min(ans1, c3);
for (i = 1; i <= m; i++) {
cin >> b[i];
ans2 += min(b[i] * c1, c2);
}
ans2 = min(ans2, c3);
cout << min(ans1 + ans2, c4) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, n, m;
int a[1005], b[1005];
int res = 0;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
int time = 0;
int num = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
time += a[i];
if (a[i]) num++;
}
for (int i = 0; i < m; i++) {
cin >> b[i];
time += b[i];
if (b[i]) num++;
}
res = min(c4, c3 * 2);
res = min(res, time * c1);
res = min(res, num * c2);
int sumA, sumB;
sumA = sumB = 0;
for (int i = 0; i < n; i++) sumA += min(c2, c1 * a[i]);
for (int i = 0; i < m; i++) sumB += min(c2, c1 * b[i]);
res = min(res, sumA + sumB);
res = min(res, c3 + min(sumA, sumB));
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:2000000")
#pragma comment(linker, "/HEAP:2000000")
using namespace std;
void print_width(long long x) {
std::cout << std::fixed;
std::cout << std::setprecision(x);
}
long long power(long long x, long long y, long long p = 1000000007) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
void printArr(long long a[], long long n) {
for (long long i = 0; i < n; i++) cout << a[i] << " ";
cout << '\n';
}
void printVector(std::vector<long long> v) {
for (long long i = 0; i < v.size(); i++) cout << v[i] << " ";
cout << '\n';
}
long long Min(long long a, long long b, long long c) {
if (a < b and a < c) return a;
if (b < c) return b;
return c;
}
void initialize(long long arr[], long long n) {
for (long long i = 0; i <= n; i++) arr[i] = i;
}
long long root(long long arr[], long long i) {
while (arr[i] != i) {
arr[i] = arr[arr[i]];
i = arr[i];
}
return i;
}
void Union(long long arr[], long long a, long long b) {
long long root_a = root(arr, a);
long long root_b = root(arr, b);
arr[root_a] = root_b;
}
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long power_wm(long long x, long long y) {
long long res = 1;
while (y > 0) {
if (y & 1) res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
long double dpower(long double x, long long y) {
long double res = 1;
while (y > 0) {
if (y & 1) res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
std::vector<long long> vsum(std::vector<long long> a) {
std::vector<long long> s(a.size());
s[0] = a[0];
for (long long i = 1; i <= a.size() - 1; i++) {
s[i] = s[i - 1] + a[i];
}
return s;
}
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
long long x = a.second * b.first;
long long y = a.first * b.second;
if (x <= y)
return false;
else
return true;
}
bool is_cap(char a) {
if (a <= 'Z' and a >= 'A')
return true;
else
return false;
}
bool is_small(char a) {
if (a <= 'z' and a >= 'a')
return true;
else
return false;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
long long n, m;
cin >> n >> m;
std::vector<long long> a(n), b(m);
long long cost = 0;
long long cost1 = 0, cost2 = 0;
for (long long i = 0; i < n; i++) {
long long t;
cin >> t;
cost1 += min(t * c1, c2);
}
cost1 = min(cost1, c3);
for (long long i = 0; i < m; i++) {
long long t;
cin >> t;
cost2 += min(t * c1, c2);
}
cost2 = min(cost2, c3);
cost = min(cost1 + cost2, c4);
cout << cost;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long c1, c2, c3, c4, n, m, i, kol1, kol, ans, ans1;
int main() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
long long a[n + 1], b[m + 1];
for (i = 1; i <= n; i++) cin >> a[i];
for (i = 1; i <= m; i++) cin >> b[i];
for (i = 1; i <= n; i++) {
long long ans = 0;
if (a[i] * c1 <= c2)
ans += a[i] * c1;
else
ans += c2;
kol += ans;
}
kol = min(c3, kol);
for (i = 1; i <= m; i++) {
long long ans1 = 0;
if (b[i] * c1 <= c2)
ans1 += b[i] * c1;
else
ans1 += c2;
kol1 += ans1;
}
kol1 = min(c3, kol1) + kol;
cout << min(kol1, c4);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[3000], b[3000];
int c1, c2, c3, c4;
int main() {
while (cin >> c1 >> c2 >> c3 >> c4) {
cin >> n >> m;
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < m; ++i) cin >> b[i];
int suma = 0;
for (int i = 0; i < n; ++i) suma += min(a[i] * c1, c2);
suma = min(suma, c3);
int sumb = 0;
for (int i = 0; i < m; ++i) sumb += min(b[i] * c1, c2);
sumb = min(sumb, c3);
int sum = min(suma + sumb, c4);
cout << sum << 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 costBus[n];
int totalCostBus = 0;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
costBus[i] = min(temp * c1, c2);
totalCostBus += costBus[i];
}
int costTrolley[m];
int totalCostTrolley = 0;
for (int i = 0; i < m; i++) {
int temp;
cin >> temp;
costTrolley[i] = min(temp * c1, c2);
totalCostTrolley += costTrolley[i];
}
int result = c4;
result = min(result, c3 + c3);
result = min(result, c3 + totalCostTrolley);
result = min(result, totalCostBus + c3);
result = min(result, totalCostBus + totalCostTrolley);
cout << result << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c[5], a[1001], b[1001];
int min(int x, int cc1, int cc2) {
int d = x * cc1, e = cc2, min = 0;
if (d < e)
min = d;
else
min = e;
return min;
}
int main() {
int i, n, m;
long long int suma, sumb;
for (i = 1; i <= 4; i++) scanf("%d", &c[i]);
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) scanf("%d", &a[i]);
for (i = 1; i <= m; i++) scanf("%d", &b[i]);
suma = 0;
for (i = 1; i <= n; i++) {
suma += min(a[i], c[1], c[2]);
}
sumb = 0;
for (i = 1; i <= m; i++) {
sumb += min(b[i], c[1], c[2]);
}
if (suma > c[3]) suma = c[3];
if (sumb > c[3]) sumb = c[3];
if (suma + sumb > c[4]) {
suma = c[4];
sumb = 0;
}
cout << suma + sumb << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int C[4], N, M;
int bus[1005];
int trolley[1005];
int _min(int a, int b) { return (a <= b) ? a : b; }
int main() {
int i;
int sumBus = 0, sumTrolley = 0;
scanf("%d %d %d %d", &C[0], &C[1], &C[2], &C[3]);
scanf("%d %d", &N, &M);
for (i = 0; i < N; i++) {
scanf("%d", &bus[i]);
sumBus += _min(bus[i] * C[0], C[1]);
}
for (i = 0; i < M; i++) {
scanf("%d", &trolley[i]);
sumTrolley += _min(trolley[i] * C[0], C[1]);
}
sumBus = _min(sumBus, C[2]);
sumTrolley = _min(sumTrolley, C[2]);
int ans = sumBus + sumTrolley;
ans = _min(ans, C[3]);
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1024;
long long n, m, ans;
long long a[MAXN], b[MAXN];
long long c1, c2, c3, c4;
long long cnt1, cnt2, cnt3, cnt4;
int32_t main() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> 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 sm = 0;
for (long long i = 0; i < n; i++) {
long long x = a[i] * c1;
if (x > c2)
cnt2++, ans += c2;
else
cnt1++, ans += x;
if (ans > c3) {
cnt3 = 1;
cnt1 = cnt2 = 0;
ans = c3;
break;
}
}
for (long long i = 0; i < m; i++) {
long long x = b[i] * c1;
if (x > c2)
cnt2++, sm += c2;
else
cnt1++, sm += x;
if (sm > c3) {
sm = c3;
break;
}
}
return cout << min(ans + sm, c4) << '\n', false;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long c1, c2, c3, c4, n, m, i;
long long nn[1100], mm[1100];
long long nresult, mresult, sn, sm;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
sn = 0;
nresult = 0;
for (i = 0; i < n; ++i) {
cin >> nn[i];
if (nn[i] * c1 > c2)
nresult += c2;
else
nresult += nn[i] * c1;
}
nresult = min(c3, nresult);
sm = 0;
mresult = 0;
for (i = 0; i < m; ++i) {
cin >> mm[i];
if (mm[i] * c1 > c2)
mresult += c2;
else
mresult += mm[i] * c1;
}
mresult = min(c3, mresult);
cout << min(nresult + mresult, c4);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c[4];
int N, M;
int A, B;
int a, b;
int main() {
int i;
for (i = 0; i < 4; i++) scanf("%d", &c[i]);
scanf("%d %d", &N, &M);
for (i = 0; i < N; i++) {
scanf("%d", &A);
a += min(c[1], c[0] * A);
}
a = min(a, c[2]);
for (i = 0; i < M; i++) {
scanf("%d", &B);
b += min(c[1], c[0] * B);
}
b = min(b, c[2]);
printf("%d\n", min(c[3], a + b));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int c1, c2, c3, c4, n, m, total = 0;
long long int type11 = 0, type12 = 0, type31 = 0;
long long int type21 = 0, type22 = 0, type32 = 0, type4 = 0, i;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
int a[n], b[m];
for (i = 0; i < n; i++) {
cin >> a[i];
type11 += a[i];
}
for (i = 0; i < m; i++) {
cin >> b[i];
type12 += b[i];
}
for (i = 0; i < n; i++) {
if (a[i] * c1 >= c2) {
type11 -= a[i];
type21++;
}
}
for (i = 0; i < m; i++) {
if (b[i] * c1 >= c2) {
type12 -= b[i];
type22++;
}
}
total = type11 * c1 + type21 * c2;
if (c3 < total) {
type11 = 0;
type21 = 0;
type31 = 1;
}
total = type12 * c1 + type22 * c2;
if (c3 < total) {
type12 = 0;
type22 = 0;
type32 = 1;
}
total =
(type11 + type12) * c1 + (type21 + type22) * c2 + (type31 + type32) * c3;
if (total > c4) {
type11 = 0;
type12 = 0;
type31 = 0;
type21 = 0;
type22 = 0;
type32 = 0;
type4 = 1;
}
total = (type11 + type12) * c1 + (type21 + type22) * c2 +
(type31 + type32) * c3 + type4 * c4;
cout << total << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int p[4], b, t, s[4], ansb = 0, anst = 0;
s[0] = 0;
s[1] = 0;
s[2] = 0;
s[3] = 0;
cin >> p[0] >> p[1] >> p[2] >> p[3] >> b >> t;
int bb[b], tt[t];
for (int i = 0; i < b; i++) cin >> bb[i];
for (int i = 0; i < t; i++) cin >> tt[i];
for (int i = 0; i < b; i++) {
if (bb[i] * p[0] <= p[1])
s[0] += bb[i] * p[0];
else
s[1] += p[1];
}
if (s[0] + s[1] <= p[2])
ansb = s[0] + s[1];
else
ansb = p[2];
s[0] = 0;
s[1] = 0;
s[2] = 0;
s[3] = 0;
for (int i = 0; i < t; i++) {
if (tt[i] * p[0] <= p[1])
s[0] += tt[i] * p[0];
else
s[1] += p[1];
}
if (s[0] + s[1] <= p[2])
anst = s[0] + s[1];
else
anst = p[2];
if (anst + ansb <= p[3])
cout << anst + ansb;
else
cout << p[3];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
long long count = 0;
int n, m;
cin >> n >> m;
long long bussum = 0;
int i;
long long a;
for (i = 0; i < n; i++) {
cin >> a;
bussum += min(a * c1, c2);
if (a != 0) count++;
}
bussum = min(bussum, c3);
count = 0;
long long trsum = 0;
for (i = 0; i < m; i++) {
cin >> a;
trsum += min(a * c1, c2);
if (a != 0) count++;
}
trsum = min(trsum, c3);
bussum = min(c4, bussum + trsum);
cout << bussum;
return 0;
}
|
#include <bits/stdc++.h>
int C1, C2, C3, C4, N, M;
int n[1025], m[1025];
int main() {
while (scanf("%d%d%d%d", &C1, &C2, &C3, &C4) != EOF) {
scanf("%d%d", &N, &M);
for (int i = 1; i <= N; i++) scanf("%d", &n[i]);
for (int i = 1; i <= M; i++) scanf("%d", &m[i]);
int sn = 0, sm = 0;
for (int i = 1; i <= N; i++) sn += n[i];
for (int i = 1; i <= M; i++) sm += m[i];
sn *= C1;
sm *= C1;
for (int i = 1; i <= N; i++)
if (n[i] * C1 > C2) {
sn -= n[i] * C1;
sn += C2;
}
for (int i = 1; i <= M; i++)
if (m[i] * C1 > C2) {
sm -= m[i] * C1;
sm += C2;
}
if (sn > C3) sn = C3;
if (sm > C3) sm = C3;
if (sn + sm > C4)
printf("%d\n", C4);
else
printf("%d\n", sn + sm);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, n, m;
scanf("%d %d %d %d %d %d", &c1, &c2, &c3, &c4, &n, &m);
int V[n], W[m];
for (int i = 0; i < n; i++) scanf("%d", &V[i]);
for (int i = 0; i < m; i++) scanf("%d", &W[i]);
int s1 = 0, s2 = 0, s3 = 0;
for (int i = 0; i < n; i++) {
if (c1 * V[i] < c2)
s1 += c1 * V[i];
else
s1 += c2;
}
if (s1 < c3)
s2 += s1;
else
s2 += c3;
for (int i = 0; i < m; i++) {
if (c1 * W[i] < c2)
s3 += c1 * W[i];
else
s3 += c2;
}
if (s3 < c3)
s2 += s3;
else
s2 += c3;
if (s2 < c4)
printf("%d\n", s2);
else
printf("%d\n", c4);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
while (cin >> c1 >> c2 >> c3 >> c4) {
int N, M, i, j, k, Sum = 0, SumT = 0;
vector<int> Bus, Train;
cin >> N >> M;
while (N--) {
cin >> i;
Bus.push_back(i);
}
while (M--) {
cin >> i;
Train.push_back(i);
}
Sum = 0;
for (i = 0; i < Bus.size(); i++) {
if (Bus[i] * c1 < c2)
Sum += Bus[i] * c1;
else
Sum += c2;
}
if (Sum > c3) Sum = c3;
for (i = 0; i < Train.size(); i++) {
if (Train[i] * c1 < c2)
SumT += Train[i] * c1;
else
SumT += c2;
}
if (SumT > c3) SumT = c3;
if (SumT + Sum < c4)
cout << SumT + Sum << endl;
else
cout << c4 << endl;
;
}
}
|
#include <bits/stdc++.h>
int a[1005], b[1005];
int Min(int x, int y) { return x < y ? x : y; }
int main() {
int c1, c2, c3, c4, n, m, i;
scanf("%d%d%d%d", &c1, &c2, &c3, &c4);
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
for (i = 0; i < m; i++) scanf("%d", &b[i]);
int sum1 = 0, sum2 = 0;
for (i = 0; i < n; i++) {
sum1 += Min(c1 * a[i], c2);
}
for (i = 0; i < m; i++) {
sum2 += Min(c1 * b[i], c2);
}
int sum3 = Min(Min(sum1 + sum2, sum1 + c3), sum2 + c3);
int sum4 = c3 * 2;
printf("%d\n", Min(Min(sum3, sum4), c4));
}
|
#include <bits/stdc++.h>
using namespace std;
string convertTostr(unsigned long long x) {
stringstream ss;
ss << x;
string st;
st = ss.str();
return st;
}
unsigned long long convertToint(string y) {
unsigned long long num;
stringstream ss(y);
ss >> num;
return num;
}
bool g(pair<int, string> x, pair<int, string> y) {
return ((x.first > y.first) || (x.first == y.first && x.second < y.second));
}
bool check(string x, string y) {
if (x[0] == y[1] && x[1] == y[0]) return true;
return false;
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int c1, c2, c3, c4, sum;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
vector<int> bus, tro;
int a, b;
for (int i = 0; i < n; i++) {
cin >> a;
bus.push_back(a);
}
for (int i = 0; i < m; i++) {
cin >> b;
tro.push_back(b);
}
sort(bus.begin(), bus.end());
sort(tro.begin(), tro.end());
int busmin = c3;
int index;
for (int i = 0; i <= n; i++) {
sum = i * c2;
index = n - 1 - i;
for (int j = 0; j < n - i; j++) {
sum += bus[index] * c1;
index--;
}
busmin = min(busmin, sum);
}
int tromin = c3;
for (int i = 0; i <= m; i++) {
sum = i * c2;
index = m - 1 - i;
for (int j = 0; j < m - i; j++) {
sum += tro[index] * c1;
index--;
}
tromin = min(tromin, sum);
}
cout << min(c4, tromin + busmin);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long c1, c2, c3, c4, n, m, a[1000], b[1000], i, g[1000], h[1000],
s = 0, t = 0, f = 0;
scanf("%ld %ld %ld %ld\n", &c1, &c2, &c3, &c4);
scanf("%ld %ld\n", &n, &m);
for (i = 0; i < n; i++) {
scanf("%ld", &a[i]);
if (a[i] * c1 < c2)
g[i] = a[i] * c1;
else
g[i] = c2;
t = t + g[i];
}
if (t > c3) t = c3;
for (i = 0; i < m; i++) {
scanf("%ld", &b[i]);
if (b[i] * c1 < c2)
h[i] = b[i] * c1;
else
h[i] = c2;
s = s + h[i];
}
if (s > c3) s = c3;
if (s + t > c4) {
s = c4;
f = 1;
}
if (f == 0)
printf("%ld\n", s + t);
else
printf("%ld\n", s);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
int n, m, x;
int b = 0, t = 0, tot = 0;
scanf("%d %d %d %d", &c1, &c2, &c3, &c4);
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
if (x * c1 > c2)
b += c2;
else
b += x * c1;
}
if (b > c3) b = c3;
for (int i = 1; i <= m; i++) {
scanf("%d", &x);
if (x * c1 > c2)
t += c2;
else
t += x * c1;
}
if (t > c3) t = c3;
tot = b + t;
if (tot > c4) tot = c4;
printf("%d\n", tot);
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1009];
int b[1009];
int main(void) {
int i, c1, c2, c3, c4;
int n, m;
while (scanf("%d %d %d %d", &c1, &c2, &c3, &c4) == 4) {
scanf("%d %d", &n, &m);
for (i = 1; i <= n; i++) scanf("%d", &a[i]);
for (i = 1; i <= m; i++) scanf("%d", &b[i]);
int cost1 = 0;
int cost2 = 0;
int tmp = 0;
for (i = 1; i <= n; i++) {
if (a[i] * c1 < c2)
tmp += a[i] * c1;
else
tmp += c2;
}
if (tmp < c3)
cost1 = tmp;
else
cost1 = c3;
tmp = 0;
for (i = 1; i <= m; i++) {
if (b[i] * c1 < c2)
tmp += b[i] * c1;
else
tmp += c2;
}
if (tmp < c3)
cost2 = tmp;
else
cost2 = c3;
if (cost1 + cost2 < c4)
printf("%d\n", cost1 + cost2);
else
printf("%d\n", c4);
}
return 0;
}
|
#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;
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];
vector<int> sa(n), sb(m);
for (int i = 0; i < n; i++) sa[i] = min(a[i] * c1, c2);
for (int i = 0; i < m; i++) sb[i] = min(b[i] * c1, c2);
int ssa = 0, ssb = 0;
for (int i = 0; i < n; i++) ssa += sa[i];
for (int j = 0; j < m; j++) ssb += sb[j];
ssa = min(ssa, c3);
ssb = min(ssb, c3);
int res = min(ssa + ssb, c4);
cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-13;
const long double PI = acos(-1);
const int INF = (int)1e9;
const long long INFF = (long long)1e18;
const int mod = (int)1e9 + 7;
const int MXN = (int)5e5 + 7;
int a[MXN], b[MXN], c[7];
int main(void) {
for (int i = 1; i < 5; ++i) scanf("%d", c + i);
int n, m;
scanf("%d %d", &n, &m);
for (int i = 1; i < n + 1; ++i) scanf("%d", a + i);
for (int i = 1; i < m + 1; ++i) scanf("%d", b + i);
int v1 = 0, v2 = 0;
for (int i = 1; i < n + 1; ++i) {
v1 += min(c[1] * a[i], c[2]);
}
for (int i = 1; i < m + 1; ++i) {
v2 += min(c[1] * b[i], c[2]);
}
int ans = c[4];
v1 = min(v1, c[3]);
v2 = min(v2, c[3]);
ans = min(ans, v1 + v2);
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
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 an[n], am[m];
for (int i = 0; i < n; i++) scanf("%d", &an[i]);
for (int i = 0; i < m; i++) scanf("%d", &am[i]);
{
{
int bcost = 0;
for (int i = 0; i < n; i++) {
if (an[i] * c1 > c2)
bcost += c2;
else
bcost += an[i] * c1;
}
if (bcost >= c3) bcost = c3;
int tcost = 0;
for (int i = 0; i < m; i++) {
if (am[i] * c1 > c2)
tcost += c2;
else
tcost += am[i] * c1;
}
if (tcost > c3) tcost = c3;
if (bcost + tcost < c4)
printf("%d", bcost + tcost);
else
printf("%d", c4);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
ostream& _ost = cout;
template <class T>
ostream& operator,(ostream& ost, const T& value) {
return ost << value << ",";
}
ostream& operator~(ostream& ost) { return ost << endl; }
template <class T>
string tos(const T& var) {
ostringstream ss;
ss << var;
return ss.str();
}
const int mod = 1000000007;
const int INF = 1000000;
const double EPS = 1e-10;
int c[5];
int n, m;
int a[1001], b[1001];
int main() {
for (int i = 0; i < 4; ++i) {
cin >> c[i + 1];
}
cin >> n >> m;
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < m; ++i) cin >> b[i];
int A = 0, B = 0;
for (int i = 0; i < n; ++i) A += min(a[i] * c[1], c[2]);
A = min(c[3], A);
for (int i = 0; i < m; ++i) B += min(b[i] * c[1], c[2]);
B = min(c[3], B);
cout << min(c[4], A + B) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, sumbus = 0, sumtrol = 0;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
int a[n], b[m], cbus[n], ctrol[m];
for (int i = 0; i < n; i++) {
cin >> a[i];
cbus[i] = min(a[i] * c1, c2);
sumbus += cbus[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
ctrol[i] = min(b[i] * c1, c2);
sumtrol += ctrol[i];
}
sumbus = min(sumbus, c3);
sumtrol = min(sumtrol, c3);
int sumcost = min(sumbus + sumtrol, c4);
cout << sumcost;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y) {
if (y == 0) return 1;
long long int s = power(x, y / 2);
s *= s;
if (y % 2 == 1) s *= x;
return s;
}
long long int fac(long long int x) {
long long int pppp = 1;
for (int i = 2; i <= x; i++) {
pppp *= i;
}
return pppp;
}
char ALPH[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
int main() {
int c1, c2, c3, c4, n, m;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
int x[n];
int y[n];
int h[m];
int p[m];
for (int i = 0; i < n; i++) {
cin >> x[i];
y[i] = min(x[i] * c1, c2);
}
for (int i = 0; i < m; i++) {
cin >> h[i];
p[i] = min(h[i] * c1, c2);
}
long long int sumt = 0;
long long int sumb = 0;
for (int i = 0; i < n; i++) {
sumb += y[i];
}
for (int i = 0; i < m; i++) {
sumt += p[i];
}
vector<long long int> v;
v.push_back(sumb + sumt);
v.push_back(sumb + c3);
v.push_back(sumt + c3);
v.push_back(c4);
v.push_back(c3 * 2);
sort(v.begin(), v.end());
cout << v[0];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 1000 + 10;
int n, m, c[4], b[Maxn], t[Maxn];
int main() {
for (int i = 0; i < 4; i++) cin >> c[i];
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 = c[3];
int a1 = c[2], num = 0;
for (int i = 0; i < n; i++) num += min(c[1], b[i] * c[0]);
a1 = min(a1, num);
int a2 = c[2];
num = 0;
for (int i = 0; i < m; i++) num += min(c[1], t[i] * c[0]);
a2 = min(a2, num);
ans = min(ans, a1 + a2);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, n, m;
int a[1010];
int b[1010];
int ans1, ans2, ans3;
int t1, t2;
while (~scanf("%d %d %d %d", &c1, &c2, &c3, &c4)) {
scanf("%d %d", &n, &m);
t1 = 0;
t2 = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
t1 += a[i];
}
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
t2 += b[i];
}
ans1 = c4;
ans2 = 0;
for (int i = 0; i < n; i++) ans2 = ans2 + min(c2, a[i] * c1);
ans2 = min(c3, ans2);
ans3 = 0;
for (int i = 0; i < m; i++) ans3 = ans3 + min(c2, b[i] * c1);
ans3 = min(c3, ans3);
printf("%d\n", min(ans1, ans2 + ans3));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, c, d, n, m, sum1 = 0, sum2 = 0, x;
cin >> a >> b >> c >> d >> n >> m;
while (n--) {
cin >> x;
sum1 += min(b, x * a);
}
while (m--) {
cin >> x;
sum2 += min(b, x * a);
}
sum1 = min(sum1, c), sum2 = min(sum2, c);
cout << min(sum1 + sum2, d);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int gcd(int a, int b) { return (b == 0 ? a : gcd(b, a % b)); }
inline int lcm(int a, int b) { return (a * (b / gcd(a, b))); }
inline long long int bigmod(long long int a, long long int b, long long int m) {
if (b == 0) return 1 % m;
long long int x = bigmod(a, b / 2, m);
x = (x * x) % m;
if (b % 2 == 1) {
x = (x * a) % m;
}
return x;
}
inline long long int phi(long long int n) {
long long int ret = n;
for (long long int i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0) n /= i;
}
ret -= ret / i;
}
if (n > 1) {
ret -= ret / n;
}
return ret;
}
long long int missing_number(long long int A[], long long int n) {
long long int x1 = A[0], x2 = 1;
for (int i = 1; i < n; i++) x1 ^= A[i];
for (int i = 2; i <= n + 1; i++) x2 ^= i;
return (x1 ^ x2);
}
bool isFibo(long long int n) {
long long int A = (5 * n * n + 4);
long long int B = (5 * n * n - 4);
long long int C = sqrt(A);
long long int D = sqrt(B);
return (A == (C * C) || B == (D * D));
}
long long int classini(long long int n) { return (n & 1) ? -1 : 1; }
long long int factorial(int n) {
return (n == 1 || n == 0) ? 1 : factorial(n - 1) * n;
}
long long int catanal(long long int n) {
return (factorial(2 * n) / ((factorial(n + 1) * factorial(n))));
}
string orientation_3_ordered_point(vector<pair<int, int> > V) {
long long int value =
(V[1].second - V[0].second) * (V[2].first - V[1].first) -
(V[1].first * V[0].first) * (V[2].second - V[1].second);
string res;
if (value == 0) res = "colinear";
value == 1 ? res = "clockwise" : res = "counterclockwise";
return res;
}
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int fx[] = {+0, +0, +1, -1, -1, +1, -1, +1};
int fy[] = {-1, +1, +0, +0, +1, +1, -1, -1};
string make_string(long long int num) {
stringstream ss;
ss << num;
string s;
ss >> s;
return s;
}
long long int make_num(string s) {
stringstream ss;
long long int tmp;
ss << s;
ss >> tmp;
return tmp;
}
int SET(int mask, int pos) { return (mask | (1 << pos)); }
int check(int mask, int pos) { return (mask & (1 << pos)); }
int Four[4];
int A[4000], B[4000];
int main() {
for (int i = 0; i < 4; i++) cin >> Four[i];
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> A[i];
for (int i = 0; i < m; i++) cin >> B[i];
int tot = 0, mot = 0;
for (int i = 0; i < n; i++) {
if (A[i] * Four[0] < Four[1])
tot += (A[i] * Four[0]);
else
tot += (Four[1]);
}
tot = min(tot, Four[2]);
for (int i = 0; i < m; i++) {
if (B[i] * Four[0] < Four[1])
mot += (B[i] * Four[0]);
else
mot += (Four[1]);
}
mot = min(mot, Four[2]);
cout << min(Four[3], mot + tot) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mx[4] = {1, -1, 0, 0};
const int my[4] = {0, 0, 1, -1};
const int Nmax = 3;
int main() {
ios_base::sync_with_stdio(0);
int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
vector<int> a(n + 1), b(m + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++) cin >> b[i];
int Answer = c4;
Answer = min(c4, 2 * c3);
int f1 = 0, f2 = 0;
for (int i = 1; i <= n; i++)
if (c1 * a[i] < c2)
f1 += c1 * a[i];
else
f1 += c2;
for (int i = 1; i <= m; i++)
if (c1 * b[i] < c2)
f2 += c1 * b[i];
else
f2 += c2;
Answer = min(Answer, f1 + f2);
Answer = min(Answer, min(f1 + c3, c3 + f2));
cout << Answer << endl;
return 0;
}
|
#include <bits/stdc++.h>
const double PI = acos(-1.);
const long long inf = 10000000000000LL;
const int MAXN = 100000 + 13;
using namespace std;
int c[4], n, m, a[1000], b[1000];
int main() {
int tmp = 0, tmp2 = 0, res = 0;
for (int i = 0; i < 4; ++i) cin >> c[i];
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> a[i];
tmp += min(a[i] * c[0], c[1]);
}
for (int i = 0; i < m; ++i) {
cin >> b[i];
tmp2 += min(b[i] * c[0], c[1]);
}
tmp = min(tmp, c[2]);
tmp2 = min(tmp2, c[2]);
cout << min(tmp + tmp2, c[3]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
vector<int> precio, bus, carro;
for (int i = 0; i < 4; i++) {
cin >> a;
precio.push_back(a);
}
cin >> b >> c;
for (int j = 0; j < b; j++) {
cin >> d;
bus.push_back(d);
}
for (int k = 0; k < c; k++) {
cin >> e;
carro.push_back(e);
}
int suma = 0, suma2 = 0, suma3;
for (int i = 0; i < b; i++) {
int aux;
aux = bus[i] * precio[0];
if (aux > precio[1]) aux = precio[1];
suma = suma + aux;
}
if (precio[2] < suma) suma = precio[2];
for (int i = 0; i < c; i++) {
int aux2;
aux2 = carro[i] * precio[0];
if (aux2 > precio[1]) aux2 = precio[1];
suma2 = suma2 + aux2;
}
if (suma2 > precio[2]) suma2 = precio[2];
suma3 = suma2 + suma;
if (precio[3] < suma3)
cout << precio[3] << endl;
else
cout << suma3 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a * (b / gcd(a, b)); }
int c1, c2, c3, c4;
int n, m;
int memocar[1000], memotroy[1000];
int car[1000], troy[1000];
int func_car(int id) {
if (id == -1) return 0;
if (memocar[id] != -1) return memocar[id];
int ans = 1000000000;
ans = min(ans, (c1 * car[id]) + func_car(id - 1));
ans = min(ans, c2 + func_car(id - 1));
return memocar[id] = ans;
}
int func_troy(int id) {
if (id == -1) return 0;
if (memotroy[id] != -1) return memotroy[id];
int ans = 1000000000;
ans = min(ans, c1 * troy[id] + func_troy(id - 1));
ans = min(ans, c2 + func_troy(id - 1));
return memotroy[id] = ans;
}
int main(void) {
memset(memocar, -1, sizeof memocar);
memset(memotroy, -1, sizeof memotroy);
scanf("%d %d %d %d", &c1, &c2, &c3, &c4);
scanf("%d %d", &n, &m);
for (int i = (0), _b = ((n)-1); i <= _b; i++) scanf("%d", &car[i]);
for (int j = (0), _b = ((m)-1); j <= _b; j++) scanf("%d", &troy[j]);
printf("%d\n", min(c4, min(c3, func_car(n - 1)) + min(c3, func_troy(m - 1))));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
typedef int* ins;
int n, m, c[4], i, nc, mc, minm, minn, fminn = 0, fminm = 0;
for (i = 0; i < 4; i++) {
cin >> c[i];
}
cin >> n >> m;
ins tn = new int[n];
ins tm = new int[m];
for (i = 0; i < n; i++) {
cin >> tn[i];
}
for (i = 0; i < m; i++) {
cin >> tm[i];
}
sort(tn, tn + n);
sort(tm, tm + m);
nc = n * c[1];
mc = m * c[1];
for (i = 0; i < n; i++) {
fminn = nc - c[1] + c[0] * tn[i];
if (fminn < nc)
nc = fminn;
else
break;
}
for (i = 0; i < m; i++) {
fminm = mc - c[1] + c[0] * tm[i];
if (fminm < mc)
mc = fminm;
else
break;
}
minm = min(mc, c[2]);
minn = min(nc, c[2]);
cout << min(c[3], minm + minn) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f, k;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &e);
scanf("%d", &f);
int sum1 = 0, sum2 = 0;
for (int i = 0; i < e; i++) {
scanf("%d", &k);
if (k * a <= b) {
sum1 += k * a;
} else
sum1 += b;
}
for (int i = 0; i < f; i++) {
scanf("%d", &k);
if (k * a <= b) {
sum2 += k * a;
} else
sum2 += b;
}
if (sum1 > c) {
sum1 = c;
}
if (sum2 > c) {
sum2 = c;
}
int sum = sum1 + sum2;
if (sum > d) {
sum = d;
}
printf("%d\n", sum);
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4, n, m, a[1001], b[1001], sum1, sum2, x;
int main() {
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
for (int i = 0; i < n; i++) {
x = c1 * a[i];
if (c2 > x)
sum1 += x;
else
sum1 += c2;
}
if (sum1 > c3) sum1 = c3;
for (int i = 0; i < m; i++) {
x = c1 * b[i];
if (c2 > x)
sum2 += x;
else
sum2 += c2;
}
if (sum2 > c3) sum2 = c3;
if (sum1 + sum2 > c4)
cout << c4 << endl;
else
cout << sum1 + sum2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, n, m, i, x, y;
scanf("%d", &c1);
scanf("%d", &c2);
scanf("%d", &c3);
scanf("%d", &c4);
scanf("%d", &n);
scanf("%d", &m);
int b1[n + 1];
int s1[m + 1];
for (i = 1; i <= n; i++) scanf("%d", &b1[i]);
for (i = 1; i <= m; i++) scanf("%d", &s1[i]);
int sum1 = 0, sum2 = 0, sum = 0;
for (i = 1; i <= n; i++) {
x = b1[i] * c1;
y = c2;
if (x >= y)
sum1 += y;
else
sum1 += x;
}
if (sum1 >= c3) sum1 = c3;
for (i = 1; i <= m; i++) {
x = s1[i] * c1;
y = c2;
if (x >= y)
sum2 += y;
else
sum2 += x;
}
if (sum2 >= c3) sum2 = c3;
sum = sum1 + sum2;
if (sum >= c4) sum = c4;
printf("%d\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int m, n, c1, c2, c3, c4, sum1 = 0, temp, sum;
int bus[1001], tro[1001];
scanf("%d%d%d%d", &c1, &c2, &c3, &c4);
scanf("%d%d", &n, &m);
int i;
for (i = 1; i <= n; i++) {
scanf("%d", &temp);
if (temp * c1 > c2)
sum1 += c2;
else
sum1 += temp * c1;
}
if (sum1 > c3)
sum = c3;
else
sum = sum1;
sum1 = 0;
for (i = 1; i <= m; i++) {
scanf("%d", &temp);
if (temp * c1 < c2)
sum1 += temp * c1;
else
sum1 += c2;
}
if (sum1 > c3)
sum += c3;
else
sum += sum1;
if (sum > c4) sum = c4;
printf("%d\n", sum);
}
|
#include <bits/stdc++.h>
int main() {
int c1, c2, c3, c4, i, m, n, a[1000], b[1000], suma = 0, sumb = 0, sum;
scanf(
"%d"
"%d"
"%d"
"%d"
"%d"
"%d",
&c1, &c2, &c3, &c4, &n, &m);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (i = 0; i < n; i++) {
if ((a[i] * c1) > c2)
suma += c2;
else
suma += (a[i] * c1);
}
for (i = 0; i < m; i++) {
if ((b[i] * c1) > c2)
sumb += c2;
else
sumb += (b[i] * c1);
}
if (suma > c3) suma = c3;
if (sumb > c3) sumb = c3;
if ((suma + sumb) > c4)
sum = c4;
else
sum = suma + sumb;
printf("%d", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, m;
int c1, c2, c3, c4;
int a[N], b[N];
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);
}
int bus = 0, trol = 0;
for (int i = 0; i < n; i++) {
bus += min(a[i] * c1, c2);
}
for (int i = 0; i < m; i++) {
trol += min(b[i] * c1, c2);
}
printf("%d\n", min(min(bus, c3) + min(trol, c3), c4));
return 0;
}
|
#include <bits/stdc++.h>
int c1, c2, c3, c4;
int n, m, x, sol, sol1;
int a, b, c;
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", &x);
(x* c1 <= c2 ? sol += x* c1 : sol += c2);
}
for (int i = 0; i < m; i++) {
scanf("%d", &x);
(x* c1 <= c2 ? sol1 += x* c1 : sol1 += c2);
}
a = (sol + sol1 <= (c3 * 2 <= c4 ? c3 * 2 : c4)
? sol + sol1
: (c3 * 2 <= c4 ? c3 * 2 : c4));
b = (sol + sol1 <= (c3 + sol <= c4 ? c3 + sol : c4)
? sol + sol1
: (c3 + sol <= c4 ? c3 + sol : c4));
c = (sol + sol1 <= (c3 + sol1 <= c4 ? c3 + sol1 : c4)
? sol + sol1
: (c3 + sol1 <= c4 ? c3 + sol1 : c4));
printf("%d", (a <= (b <= c ? b : c) ? a : (b <= c ? b : c)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char graph[105][105];
int xr[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int yc[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int rr[] = {0, -1, 0, 1};
int cc[] = {-1, 0, 1, 0};
int main() {
int c1, c2, c3, c4, n, m, t1, t2, t3, t4;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
t1 = t2 = t3 = 0;
int sum = 0, x;
for (int i = 0; i < n; i++) {
cin >> x;
t1 += (x * c1);
t2 += min(x * c1, c2);
}
t3 = c3;
sum += (min(t3, min(t1, t2)));
t1 = t2 = t3 = 0;
for (int i = 0; i < m; i++) {
cin >> x;
t1 += (x * c1);
t2 += min(x * c1, c2);
}
t3 = c3;
sum += (min(t3, min(t1, t2)));
printf("%d\n", min(sum, c4));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class A, class B>
istream &operator>>(istream &o, pair<A, B> &p) {
o >> p.first >> p.second;
return o;
}
template <class type>
istream &operator>>(istream &o, vector<type> &v) {
for (int i = 0; i < (int)v.size(); i++) o >> v[i];
return o;
}
template <class A, class B>
ostream &operator<<(ostream &o, pair<A, B> p) {
o << "(" << p.first << "," << p.second << ")";
return o;
}
template <class type>
ostream &operator<<(ostream &o, vector<type> v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++) {
if (i > 0) o << ",";
o << v[i];
}
o << "}";
return o;
}
long long toNum(string a) {
if (a.size() == 0u) return 0;
long long ret = 0;
for (int i = (a[0] == '-'); i < int(a.size()); i++)
ret = ret * 10 + a[i] - '0';
return ret * (a[0] == '-' ? -1 : 1);
}
string toStr(long long a) {
string ret = "";
bool sgn = a < 0;
a = a < 0 ? -a : a;
do {
ret.push_back(a % 10 + '0');
a /= 10;
} while (a > 0);
if (sgn) ret.push_back('-');
reverse(ret.begin(), ret.end());
return ret;
}
int dp[1005][2][2];
vector<int> cost, a, b;
int countCost(int a, int t) {
switch (t) {
case 0:
return a * cost[t];
default:
return cost[t];
}
}
int solve(int n, int bs, int tr) {
if (n < 0) return 0;
if (bs == 1 && tr == 1) return 0;
int &ret = dp[n][bs][tr];
if (ret != -1) return ret;
ret = (1 << 30);
for (int i = 0; i < int(3); i++)
for (int j = 0; j < int(3); j++) {
int t = countCost(a[n] * (!bs), i) + countCost(b[n] * (!tr), j);
ret = min(ret, t + solve(n - 1, (i == 2) || bs, (j == 2) || tr));
}
return ret;
}
int main() {
ios_base::sync_with_stdio(false);
cost = vector<int>(4);
cin >> cost;
int m, n;
cin >> m >> n;
a = b = vector<int>(max(m, n));
for (int i = 0; i < int(m); i++) cin >> a[i];
for (int i = 0; i < int(n); i++) cin >> b[i];
n = max(m, n);
memset(dp, -1, sizeof(dp));
cout << min(cost[3], solve(n - 1, 0, 0));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1005], b[1005];
int main() {
int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int bus = INT_MAX;
int tro = INT_MAX;
bus = min(bus, c3);
int temp = 0;
for (int i = 0; i < n; i++) {
temp += min(c1 * a[i], c2);
}
bus = min(bus, temp);
tro = min(tro, c3);
temp = 0;
for (int i = 0; i < m; i++) {
temp += min(c1 * b[i], c2);
}
tro = min(tro, temp);
cout << min(bus + tro, c4);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
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 double eps = 1e-9;
int fx[] = {-1, 1, 0, 0, -1, -1, 1, 1};
int fy[] = {0, 0, -1, 1, -1, 1, -1, 1};
int bus[1010];
int trol[1010];
int main() {
long long c1, c2, c3, c4;
int n, m;
long long b = 0, t = 0, res;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (long long i = 0; i < n; i++) cin >> bus[i];
for (long long i = 0; i < m; i++) cin >> trol[i];
for (long long i = 0; i < n; i++) {
b += min(bus[i] * c1, c2);
}
b = min(b, c3);
for (long long i = 0; i < m; i++) {
t += min(trol[i] * c1, c2);
}
t = min(t, c3);
res = min(c4, b + t);
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c[4], n, m, a, b, suma, sumb;
int main() {
for (int i = 0; i < 4; i++) scanf("%d", &c[i]);
scanf("%d%d", &n, &m);
suma = sumb = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
suma += min(a * c[0], c[1]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &b);
sumb += min(b * c[0], c[1]);
}
suma = min(suma, c[2]);
sumb = min(sumb, c[2]);
printf("%d\n", min(suma + sumb, c[3]));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using namespace std;
long long powm(long long base, long long exp, long long mod = 1000000007) {
long long ans = 1;
while (exp) {
if (exp & 1) ans = (ans * base) % mod;
exp >>= 1, base = (base * base) % mod;
}
return ans;
}
long long a[100005], b[100005];
int main() {
long long c1, c2, c3, c4, n, m;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
for (long long i = 1; i < n + 1; i++) cin >> a[i];
for (long long i = 1; i < m + 1; i++) cin >> b[i];
long long ans = c4, ans1 = 0, ans2 = 0;
for (long long i = 1; i < n + 1; i++) ans1 += min(c1 * a[i], c2);
for (long long i = 1; i < m + 1; i++) ans2 += min(c1 * b[i], c2);
ans = min(ans, ans1 + ans2);
ans = min(ans, ans1 + c3);
ans = min(ans, ans2 + c3);
ans = min(ans, c3 + c3);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
int C[5], N, M;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int tmp, t = 0, b = 0, ans;
for (int i = 1; i <= 4; i++) scanf("%d", &C[i]);
scanf("%d%d", &N, &M);
for (int i = 1; i <= N; i++) {
scanf("%d", &tmp);
b += min(C[1] * tmp, C[2]);
}
for (int i = 1; i <= M; i++) {
scanf("%d", &tmp);
t += min(C[1] * tmp, C[2]);
}
ans = C[4];
if (C[3] + b < ans) ans = C[3] + b;
if (C[3] + t < ans) ans = C[3] + t;
if (C[3] + C[3] < ans) ans = C[3] + C[3];
if (b + t < ans) ans = b + t;
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
const int Maxn = 10005, Maxm = 100010;
using namespace std;
typedef int Arr[Maxn];
int a, b;
int main() {
int c1, c2, c3, c4, n, m;
Arr a, b;
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 ans = c4, cn = 0, cm = 0;
for (int i = 1; i <= n; i++)
if (c1 * a[i] < c2)
cn += c1 * a[i];
else
cn += c2;
for (int i = 1; i <= m; i++)
if (c1 * b[i] < c2)
cm += c1 * b[i];
else
cm += c2;
ans = min(ans, min(cn + cm, c3 + c3));
ans = min(ans, min(cn, cm) + c3);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
int n, m;
int a[1005], b[1005];
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 ans1 = 0;
for (int i = 1; i <= n; i++) {
if (a[i] * c1 < c2)
ans1 += a[i] * c1;
else
ans1 += c2;
}
ans1 = min(ans1, c3);
int ans2 = 0;
for (int i = 1; i <= m; i++) {
if (b[i] * c1 < c2)
ans2 += b[i] * c1;
else
ans2 += c2;
}
ans2 = min(ans2, c3);
cout << min((ans1 + ans2), c4) << endl;
;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int bus[1001];
int trolley[1001];
int main() {
int n, m, c1, c2, c3, c4, res2 = 0, res3 = 0, sum = 0;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
for (int i = 0; i < n; i++) cin >> bus[i];
for (int i = 0; i < m; i++) cin >> trolley[i];
for (int i = 0; i < n; i++) sum += min(bus[i] * c1, c2);
res2 = min(sum, c3);
sum = 0;
for (int i = 0; i < m; i++) sum += min(trolley[i] * c1, c2);
res3 = min(sum, c3);
res2 += res3;
cout << min(res2, c4);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MN = 1000011;
const int inf = 1e9 + 7;
int n, m, c[5], a[MN], b[MN];
int main() {
ios ::sync_with_stdio(0);
cin.tie(0);
for (int i = (1), _b = (4); i <= _b; ++i) cin >> c[i];
cin >> n >> m;
for (int i = (1), _b = (n); i <= _b; ++i) cin >> a[i];
for (int i = (1), _b = (m); i <= _b; ++i) cin >> b[i];
int sum1 = 0, sum2 = 0;
for (int i = (1), _b = (n); i <= _b; ++i) sum1 += min(c[2], c[1] * a[i]);
sum1 = min(sum1, c[3]);
for (int i = (1), _b = (m); i <= _b; ++i) sum2 += min(c[2], c[1] * b[i]);
sum2 = min(sum2, c[3]);
cout << min(c[4], sum1 + sum2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, n, m, r1 = 0, r2 = 0, t;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
while (n--) {
cin >> t;
r1 += min(c1 * t, c2);
}
while (m--) {
cin >> t;
r2 += min(c1 * t, c2);
}
cout << min(c4, min(c3, r1) + min(c3, r2)) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int pOnce, pOne, pOneAll, pAll;
int N, M;
int main() {
scanf("%d%d%d%d", &pOnce, &pOne, &pOneAll, &pAll);
scanf("%d %d", &N, &M);
vector<int> a(N), b(M);
int sumA = 0, sumB = 0;
for (int i = 0; i < N; ++i) {
int temp;
scanf("%d", &temp);
sumA += min(pOnce * temp, pOne);
}
sumA = min(pOneAll, sumA);
for (int i = 0; i < M; ++i) {
int temp;
scanf("%d", &temp);
sumB += min(pOnce * temp, pOne);
}
sumB = min(pOneAll, sumB);
int ans = min(sumA + sumB, pAll);
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4;
int n, m;
int main() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
vector<int> b(m);
for (int j = 0; j < m; ++j) cin >> b[j];
int bus = 0;
for (auto &i : a) bus += min(c2, c1 * i);
bus = min(bus, c3);
int t = 0;
for (auto &i : b) t += min(c2, c1 * i);
t = min(t, c3);
cout << min(c4, bus + t) << endl;
}
|
#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++) {
p1 += min(buses[i] * c1, c2);
}
p1 = min(c3, p1);
int32_t p2 = 0;
for (int32_t i = 0; i < m; i++) {
p2 += min(trolleys[i] * c1, c2);
}
p2 = min(c3, p2);
cout << min(c4, p1 + p2) << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
vector<int> ans;
ans.push_back(c4);
ans.push_back(c3 * 2);
int tmp = 0, tmp1 = 0;
int n, m, a;
cin >> n >> m;
while (n--) {
cin >> a;
tmp += min(a * c1, c2);
}
while (m--) {
cin >> a;
tmp1 += min(a * c1, c2);
}
tmp1 = min(tmp1, c3);
tmp = min(tmp, c3);
ans.push_back(tmp1 + tmp);
sort(ans.begin(), ans.end());
cout << ans[0];
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4, b, t;
int bus[1005], troll[1005];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int bCost = 0, tCost = 0;
cin >> c1 >> c2 >> c3 >> c4 >> b >> t;
for (int i = 0; i < b; i++) {
cin >> bus[i];
bCost += min(c1 * bus[i], c2);
}
bCost = min(bCost, c3);
for (int i = 0; i < t; i++) {
cin >> troll[i];
tCost += min(c1 * troll[i], c2);
}
tCost = min(tCost, c3);
cout << min(bCost + tCost, c4) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[2000], b[2000];
int main() {
int c1, c2, c3, c4;
int n, m;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
int best1, best2, best;
best1 = 0;
for (int i = 0; i < n; i++) best1 += min(c1 * a[i], c2);
best2 = 0;
for (int i = 0; i < m; i++) best2 += min(c1 * b[i], c2);
best = min(best1 + best2, min(best1, best2) + c3);
best = min(best, c3 * 2);
best = min(best, c4);
cout << best << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4, n, m, autobuz[1005], trolebuz[1005];
void Citire() {
int i;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (i = 1; i <= n; i++) cin >> autobuz[i];
for (i = 1; i <= m; i++) cin >> trolebuz[i];
}
void Rezolvare() {
int i, s = 0, s1 = 0, sol;
for (i = 1; i <= n; i++)
if (c1 * autobuz[i] < c2)
s += c1 * autobuz[i];
else
s += c2;
if (s > c3) s = c3;
for (i = 1; i <= m; i++)
if (c1 * trolebuz[i] < c2)
s1 += c1 * trolebuz[i];
else
s1 += c2;
if (s1 > c3) s1 = c3;
sol = s + s1;
if (sol > c4) sol = c4;
cout << sol << " ";
}
int main() {
Citire();
Rezolvare();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mx = 1000 + 10;
const int inf = 210000;
int main() {
int c1, c2, c3, c4, n, m, a, b;
int amin = inf, bmin = inf, suma = 0, sumb = 0;
cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
for (int i = 0; i < n; ++i) {
scanf("%d", &a);
amin = min(amin, a);
suma += min(c1 * a, c2);
}
for (int i = 0; i < m; ++i) {
scanf("%d", &b);
bmin = min(bmin, b);
sumb += min(c1 * b, c2);
}
int ans = c4;
ans = min(ans, c3 * 2);
ans = min(ans, c3 + suma);
ans = min(ans, c3 + sumb);
ans = min(ans, suma + sumb);
cout << ans << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.