# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
294711 | crossing0ver | Visiting Singapore (NOI20_visitingsingapore) | C++17 | 2 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
int k,n,m,A,B,hap[5005],s[5005],t[5005];
main() {
cin >> k >> n >> m >> A >> B;
for (int i = 1; i <= k; i++)
cin >> hap[i];
for (int i = 1; i <= n; i++)
cin >> s[i];
for (int i = 1; i <= m; i++)
cin >> t[i];
int ans = A + B*n + A + B*m;
if (m <= n) {
ans = max(ans, hap[1]*m);
}else {
ans = max(ans,hap[1]*n + (m-n)*B + A);
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |