#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<algorithm>usingnamespace std;constint N =37;int a[N],b[N];int t,n,k;boolcmp(int x,int y){return x > y;}intmain(){
cin >> t;while(t--){int cnt =0;int sum =0;memset(a,0,sizeof(a));memset(b,0,sizeof(b));
cin >> n >> k;for(int i =1; i <= n; i++)
cin >> a[i];for(int i =1; i <= n; i++)
cin >> b[i];if(k==0){for(int i =1; i <= n; i++)
sum += a[i];
cout << sum << endl;continue;}sort(a+1,a+n+1);sort(b+1,b+n+1,cmp);for(int i =1; i <= n; i++){if(a[i]<b[i]){swap(a[i],b[i]);
cnt++;}if(cnt==k)break;}for(int i =1; i <= n; i++)
sum += a[i];
cout << sum << endl;}return0;}
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<algorithm>usingnamespace std;int t,n;intmain(){
cin >> t;while(t--){
cin >> n;if(n==1){
cout <<"0"<< endl;continue;}longlong sum =0;longlong node =(n-1)/2;for(longlong i =1; i <= node; i++)
sum += i * i *8;
cout << sum << endl;}return0;}