t = int(input())
for i in range(t):
line = input().split()
int_line = [int(x) for x in line]
n, k = int_line
ns = input().split()
ns = [int(x) for x in ns]
ws = input().split()
ws = [int(x) for x in ws]
ns.sort()
ws.sort()
result = 0
num_one = ws.count(1)
if num_one:
result += 2 * sum(ns[-num_one:])
ns = ns[:-num_one]
ws = ws[num_one:]
ws.reverse()
start = 0
end = len(ns) - 1
for i in range(len(ws)):
result += ns[end]
end -= 1
result += ns[start]
start += ws[i]-1
print(result)
#include<bits/stdc++.h>
using namespace std;
#define N 500005
int main()
{
int t,n,a[N],i,k,p[N],b,x,y;
long long int ans;
cin>>t;
while(t--)
{
cin>>n>>k;
b=0;
for(i=1;i<=n;++i)
{
cin>>a[i];
}
sort(a+1,a+n+1);
for(i=1;i<=k;++i)
{
cin>>p[i];
b+=p[i]==1;
}
ans=0;
for(i=n;i>n-b;i--)
{
ans+=a[i]+a[i];
}
sort(p+1,p+k+1);
y=n-b,x=1;
for(i=k;i>b;i--)
{
ans+=a[x]+a[y];
x+=p[i]-1;
y--;
}
cout<<ans<<"\n";
}
} 137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |