题意:有n个宾客,m件独一无二的礼物,礼物价值为 c i c_i ci,按编号递增(即 c 1 < c 2 < = c 3 < = . . . c m c_1<c_2<=c_3< =...c_m c1<c2<=c3<=...cm);现在要给每个宾客送礼物,每个宾客有个各自的编号 a i a_i ai( 1 < = a i < = m 1<=a_i<=m 1<=ai<=m),可以给每个宾客送礼物编号小于等于 a i a_i ai的礼物,或者直接送给宾客 C a i C_{a_i} Cai的现金。问怎么送礼物或者现金,使得总开销最小。
题解:由于礼物是唯一的,且送礼物有对应的价值上限,我们可以贪心地分配礼物,优先把便宜的礼物送给编号较高的宾客。
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 300010;
int n, m;
int a[maxn], c[maxn];
int main() {
int t;
scanf("%d", &t);
while (t--) {
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", &c[i]);
}
sort(a + 1, a + n + 1, [](int &x, int &y) {
return x > y;
});
ll ans = 0;
for (int i = 1, j = 1; i <= n; ++i) {
if (a[i] > j) {
ans += c[j];
++j;
} else {
ans += c[a[i]];
}
}
printf("%lld\n", ans);
}
}