题目描述
The magic shop in Mars is offering some magic coupons. Each coupon has an integer N printed on it, meaning that when you use this coupon with a product, you may get N times the value of that product back! What is more, the shop also offers some bonus product for free. However, if you apply a coupon with a positive N to this bonus product, you will have to pay the shop N times the value of the bonus product... but hey, magically, they have some coupons with negative N's!
For example, given a set of coupons {1 2 4 -1}, and a set of product values {7 6 -2 -3} (in Mars dollars M$) where a negative value corresponds to a bonus product. You can apply coupon 3 (with N being 4) to product 1 (with value M$7) to get M$28 back; coupon 2 to product 2 to get M$12 back; and coupon 4 to product 4 to get M$3 back. On the other hand, if you apply coupon 3 to product 4, you will have to pay M$12 to the shop.Each coupon and each product may be selected at most once. Your task is to get as much money back as possible.
火星上的神奇商店提供一些魔法优惠券。每张优惠券都印有一个整数N,这意味着当您将此优惠券与产品一起使用时,您可能会获得该产品价值的N倍!更重要的是,该商店还免费提供一些奖金产品。但是,如果你在这个奖励产品上使用正面N的优惠券,你将需要向商店支付N倍于奖励产品的价值......但是,嘿,奇怪的是,他们有一些负N的优惠券!
例如,给定一组优惠券{1 2 4 -1},以及一组产品值{7 6 -2 -3}(以美元M $计算),其中负值对应于奖励产品。您可以将优惠券3(N为4)应用于产品1(价值M $ 7)以获得M $ 28; 优惠券2到产品2获得12美元的回报; 和优惠券4到产品4获得M $ 3回来。另一方面,如果您将优惠券3应用于产品4,则必须向商店支付12澳元。
每个优惠券和每个产品最多可以选择一次。你的任务是获得尽可能多的钱。
输入描述:
Each input file contains one test case. For each case, the first line contains the number of coupons NC, followed by a line with NC coupon integers. Then the next line contains the number of products NP, followed by a line with NP product values. Here 1<= NC, NP <= 105, and it is guaranteed that all the numbers will not exceed 230. 每个输入文件包含一个测试用例。对于每种情况,第一行包含优惠券NC的数量,后面是具有NC优惠券整数的行。然后下一行包含产品数量NP,接着是包含NP产品值的行。这里1 <= NC,NP <= 10 5,保证所有数字不超过2的30次方。
输出描述:
For each test case, simply print in a line the maximum amount of money you can get back.
对于每个测试用例,只需在一行中打印出您可以获得的最大金额。
示例1
输入
4 1 2 4 -1 4 7 6 -2 -3
输出
43
题目分析:
这个题目就是想让两个数组中的数两两相乘所得的积在相加(数组中的数不一定全都要用,每个数最多用一次),使所得的和最大,我们可以先给数组排序,然后将最小的负数和最小的负数相乘(值最大),最大的正数和最大的正数相乘(值最大),然后在将他们加起来。
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void magicCoupon(int n, int m, long[] a, long[] b)
{
//给数组排序
Arrays.sort(a);
Arrays.sort(b);
int la ;
int lb ;
long sum = 0l;
//找两个数组中的第一个非负数的下标
for (int i=0; ; i++)
{
if (a[i] > 0)
{
la = i;
break;
}
}
for (int i=0; ; i++)
{
if (b[i] > 0)
{
lb = i;
break;
}
}
// 最小的负数和最小的负数相乘然后相加
int index = la>lb?lb:la;
for (int i=0; i<index; i++)
{
sum += a[i]*b[i];
}
//最大的正数和最大的整数相乘再相加
for (int i=n-1, j=m-1; i>=la&&j>=lb; i--, j--)
{
sum += a[i]*b[j];
}
System.out.println(sum);
}
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
while (s.hasNext())
{
int n = s.nextInt();
long[] a = new long[n];
for (int i=0; i<n; i++)
{
a[i] = s.nextLong();
}
int m = s.nextInt();
long[] b = new long[m];
for (int i=0; i<m; i++)
{
b[i] = s.nextLong();
}
magicCoupon(n, m, a, b);
}
}
}
运行结果: