题意:
给一些主武器和副武器,每个武器有一个价值和最多五个属性值,选择一个主武器和一个副武器,使得价值加上五个属性的差值最大。
思路:
因为最多只有五个属性,而abs(x1-x2)=max(x1-x2,x2-x1),所以每个武器的每个属性对于最后的答案有两种情况,加上这个属性值或者减去这个属性值。
所以枚举属性值的每种加减情况,然后选主副武器相反的加减值相加,取最大值。每个值初始化为-INF。
代码:
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cstdio>
#include <string>
#include <bitset>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#define X first
#define Y second
#define lch (o<<1)
#define rch (o<<1|1)
#define pb push_back
#define lowbit(x) (x&-x)
#define pii pair<int,int>
#define sd(n) scanf("%d",&n)
#define sf(n) scanf("%lf",&n)
#define cout1(x) cout<<x<<endl
#define pdd pair<double,double>
#define ALL(x) x.begin(),x.end()
#define sdd(n,m) scanf("%d%d",&n,&m)
#define INS(x) inserter(x,x.begin())
#define mst(a,b) memset(a,b,sizeof(a))
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define cout2(x,y) cout<<x<<" "<<y<<endl
#define qclear(a) while(!a.empty())a.pop()
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define IOS std::ios::sync_with_stdio(false)
#define SRAND srand((unsigned int)(time(0)))
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define cout3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
const double PI=acos(-1.0);
const int INF=0x3f3f3f3f;
const double eps=1e-3;
const ll mod=1e9;
const int maxn=100;
const int maxm=50005;
int n,m,k;
ll a[maxn];
ll b[maxn];
int xx[maxn];
void solve() {
int t;
sd(t);
while(t--){
sddd(n,m,k);
int lim=1<<k;
mst(a,-INF);
mst(b,-INF);
for(int i=0;i<n;i++){
int s;
sd(s);
for(int j=0;j<k;j++){
int now;
sd(xx[j]);
}
for(int j=0;j<lim;j++){
ll now=s;
for(int jj=0;jj<k;jj++){
if(j&(1<<jj)){
now+=xx[jj];
}else{
now-=xx[jj];
}
}
a[j]=max(a[j],now);
}
}
for(int i=0;i<m;i++){
int s;
sd(s);
for(int j=0;j<k;j++){
sd(xx[j]);
}
for(int j=0;j<lim;j++){
ll now=s;
for(int jj=0;jj<k;jj++){
if(j&(1<<jj)){
now+=xx[jj];
}else{
now-=xx[jj];
}
}
b[j]=max(b[j],now);
}
}
ll ans=-INF;
for(int i=0;i<lim;i++){
int s1=i;
int s2=lim-1-i;
ans=max(ans,a[s1]+b[s2]);
}
printf("%lld\n",ans);
}
return ;
}
int main() {
#ifdef LOCAL
freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
#else
// freopen("","r",stdin);
// freopen("","w",stdout);
#endif
solve();
return 0;
}