|
||||||||||
Problem J. CSGOTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1733 Accepted Submission(s): 872 Problem Description You are playing CSGO. There are n Main Weapons and m Secondary Weapons in CSGO. You can only choose one Main Weapon and one Secondary Weapon. For each weapon, it has a composite score S. The higher the composite score of the weapon is, the better for you. Also each weapon has K performance evaluations x[1], x[2], …, x[K].(range, firing rate, recoil, weight…) So you shold consider the cooperation of your weapons, you want two weapons that have big difference in each performance, for example, AWP + CZ75 is a good choose, and so do AK47 + Desert Eagle. All in all, you will evaluate your weapons by this formula.(MW for Main Weapon and SW for Secondary Weapon) Now you have to choose your best Main Weapon & Secondary Weapon and output the maximum evaluation. Input Multiple query. On the first line, there is a positive integer T, which describe the number of data. Next there are T groups of data. for each group, the first line have three positive integers n, m, K. then, the next n line will describe n Main Weapons, K+1 integers each line S, x[1], x[2], …, x[K] then, the next m line will describe m Secondary Weapons, K+1 integers each line S, x[1], x[2], …, x[K] There is a blank line before each groups of data. T<=100, n<=100000, m<=100000, K<=5, 0<=S<=1e9, |x[i]|<=1e9, sum of (n+m)<=300000 Output Your output should include T lines, for each line, output the maximum evaluation for the corresponding datum. Sample Input
Sample Output
Source | ||||||||||
|