【CF1470A】 - Strange Birthday Party

最新推荐文章于 2023-10-21 08:30:00 发布

不可知论大祭司

最新推荐文章于 2023-10-21 08:30:00 发布

阅读量147

点赞数

分类专栏：贪心文章标签： C++ 动态规划最小成本排序读取输入

本文链接：https://blog.csdn.net/weixin_50070650/article/details/112918158

版权

贪心专栏收录该内容

11 篇文章 1 订阅

订阅专栏

code

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <vector>

using namespace std;
inline int read(){
    int x = 0, op = 1; char ch = getchar();
    while (!isdigit(ch)){
        if (ch == '-') op = -1; ch = getchar();}
    while (isdigit(ch)){
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * op;
}
inline void write(int x){
    if (x < 0) putchar('-'), x = - x;
    if (x > 9) write(x / 10);
    putchar('0' + x % 10);
}

void solve(){
    int n = read(), m = read();
    vector<int> num(n);
    vector<int> cost(m);
    for (int &e : num) e = read();
    for (int& c: cost) c = read();
    cost.push_back(2e9);
    sort(num.rbegin(), num.rend());
    int index = 0;
    long long res = 0;
    for (int i = 0; i < n; ++i) {
        if (index <= num[i] - 1 && cost[index] < cost[num[i] - 1]){
            res += cost[index++];
        }else{
            res += cost[num[i] - 1];
        }
    }
    printf("%lld\n", res);
}

signed main(){
    int cases = read();
    while (cases--){
        solve();
    }
    return 0;
}