Competitive-Programming/2143B.cpp at main · TrainingBear/Competitive-Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <bits/stdc++.h>
using namespace std;

int t, n, k;
const int MAXN = 2e5+5;
long p[MAXN], d[MAXN];

void solve(){
    cin >> n >> k;
    long long ans = 0;
    int free = 0;
    for(int i = 0; i < n; i++){
        cin >> p[i];
    }

    for(int i = 0; i < k; i++){
        cin >> d[i];
    }

    sort(d, d+k);
    sort(p, p+n, greater<int>());

    int j = 0;
    for(int i = 0; i < n; i++){
        if(
            // i > k-1 ||
            j >= k) {
            ans+= p[i];
        }
        else {
            // cout << i << ": " << p[i] << ", ";
            for(int k = 0; k < d[j]-1; k++){
                if(i>=n) break;
                ans += p[i];
                i++;
            }
        }
        j++;
    }
    cout << ans << '\n';
}

int main(){
    cin >> t; while(t--) solve();
}