-
Notifications
You must be signed in to change notification settings - Fork 0
/
C.cpp
112 lines (97 loc) · 2.17 KB
/
C.cpp
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
//https://codeforces.com/contest/1369/problem/C
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<vpi> vvpi;
typedef vector<vpl> vvpl;
typedef set<int> si;
typedef multiset<int> msi;
typedef set<ll> sl;
typedef multiset<ll> msl;
#define clrcin cin.ignore(numeric_limits<streamsize>::max(),'\n');
#define GOGOGO ios::sync_with_stdio(false); cin.tie(nullptr);
#define BYEBYE return 0;
#define all(cn) (cn).begin(), (cn).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repk(i, k, n) for(int i = k; i < n; ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define popcnt __builtin_popcount
#define gcd std::__detail::__gcd
#define lcm std::__detail::__lcm
const int INFI = 1e9 + 5;
const ll INFL = 4e18 + 5;
void solve()
{
int n, k; cin >> n >> k;
vl a(n);
vl w;
int cur;
rep(i, n) {cin >> a[i];}
sort(all(a));
ll sum = 0;
int cmax = n - 1;
rep(i, k) {cin >> cur;
if (cur == 1)
{
sum += 2 * a[cmax];
cmax--;
}
else
{
w.pb(cur);
}
}
sort(w.rbegin(), w.rend());
// we want every time f - 1 minimums and a maximum
int cmin = 0;
int old = -1;
for(auto f : w)
{
if (f == 1)
{
sum += 2 * a[cmax];
cmax--;
}
else
{
sum += a[cmax] + a[cmin];
cmin += f-1;
cmax--;
}
/*
// old+1 - old + w
if ( f - 2 >= 0)
{
sum += a[cmin];
cmin = cmin + f - 1;
sum += a[cmax];
}
else
{
sum += 2 * a[cmax];
}
cmax--;*/
}
cout << sum << endl;
}
int main()
{
GOGOGO
int t; cin >> t;
while(t--)
{
solve();
}
BYEBYE
}