#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
using ll = long long;
using pll = pair<ll, ll>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
//___________________________
ll n, m, k; cin >> n >> m >> k;
vector<ll> p(n), b(m+1);
for (ll i = 0; i < n; i++) cin >> p[i];
for (ll i = 0; i < m+1; i++) cin >> b[i];
vector<ll> diff(m+1);
for (ll i = 0; i < m; i++) diff[i] = b[i+1]-b[i];
diff[m] = 0;
while (k) {
ll idx = 0;
for (ll i = 1; i < n; i++) {
if (p[i] < m && diff[p[i]] > diff[p[idx]]) idx = i;
}
p[idx]++;
k--;
}
ll ans = 0;
for (ll i = 0; i < n; i++) ans += b[p[i]];
cout << ans << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |