PAT1037Java

PAT笔记

1037 Magic Coupon

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.

Input Specification:

Each input file contains one test case. For each case, the first line contains the number of coupons N
​C​​ , followed by a line with NCcoupon integers. Then the next line contains the number of products N
​P​​ , followed by a line with NP product values. Here 1≤N​C​​ ,NP≤10 ^5
,and it is guaranteed that all the numbers will not exceed 2^​30.
​​ .

Output Specification:

For each test case, simply print in a line the maximum amount of money you can get back.

贪心思想，直接对两个数组进行排序，正数再后面，负数在前面，分别进行扫描即可。
这里卡了第2个示例，答案错误。不懂为什么

import java.io.*;
import java.util.*;
public class Main{

    public static void main(String[]args)throws IOException{
        BufferedReader input=new BufferedReader(new InputStreamReader(System.in));
        int n=Integer.valueOf(input.readLine());

        String s1[]=input.readLine().split(" ");
        int a[]=new int[n];
        for(int i=0;i<n;i++) a[i]=Integer.valueOf(s1[i]);
        int m=Integer.valueOf(input.readLine());

        String s2[]=input.readLine().split(" ");
        int b[]=new int[m];
        for(int i=0;i<m;i++) b[i]=Integer.valueOf(s2[i]);
        Arrays.sort(a);
        Arrays.sort(b);
        long res=0;
        int i=n-1,j=m-1;
        while(i>=0&&j>=0&&a[i]>0&&b[j]>0){
            res+=a[i]*b[i];
            i--;
            j--;
        }
        i=0;
        while(i<n&&i<m&&a[i]<0&&b[i]<0){
            res+=a[i]*b[i];
            i++;

        }
        System.out.println(res);
    }
}