PTA数据结构与算法题目集(中文) 7-39魔法优惠券 (25 分)

PTA数据结构与算法题目集(中文)  7-39魔法优惠券 (25 分)

7-39 魔法优惠券 (25 分)

 

在火星上有个魔法商店，提供魔法优惠券。每个优惠劵上印有一个整数面值K，表示若你在购买某商品时使用这张优惠劵，可以得到K倍该商品价值的回报！该商店还免费赠送一些有价值的商品，但是如果你在领取免费赠品的时候使用面值为正的优惠劵，则必须倒贴给商店K倍该商品价值的金额…… 但是不要紧，还有面值为负的优惠劵可以用！（真是神奇的火星）

例如，给定一组优惠劵，面值分别为1、2、4、-1；对应一组商品，价值为火星币M$7、6、-2、-3，其中负的价值表示该商品是免费赠品。我们可以将优惠劵3用在商品1上，得到M$28的回报；优惠劵2用在商品2上，得到M$12的回报；优惠劵4用在商品4上，得到M$3的回报。但是如果一不小心把优惠劵3用在商品4上，你必须倒贴给商店M$12。同样，当你一不小心把优惠劵4用在商品1上，你必须倒贴给商店M$7。

规定每张优惠券和每件商品都只能最多被使用一次，求你可以得到的最大回报。

输入格式:

输入有两行。第一行首先给出优惠劵的个数N，随后给出N个优惠劵的整数面值。第二行首先给出商品的个数M，随后给出M个商品的整数价值。N和M在[1, 1]之间，所有的数据大小不超过2​30​​，数字间以空格分隔。

输出格式:

输出可以得到的最大回报。

输入样例:

4 1 2 4 -1
4 7 6 -2 -3

输出样例:

43
题目分析：用优先队列来每次找出最好的情况，看了大佬的做法，其实只需要排序就好了，每次找出符号相同的最好情况 但这题我最后一个测试题无法通过

 #define _CRT_SECURE_NO_WARNINGS
 #include<stdio.h>
 #include<string.h>
 #include<malloc.h>
 #define INIFITY -65535
 typedef struct HeapStruct* H;
 struct HeapStruct
 {
     int Heap[];
     int Size;
 }MaxHeap1,MaxHeap2;

 int Delete(H MaxHeap)
 {
     int Max = MaxHeap->Heap[];
     int Tmp = MaxHeap->Heap[MaxHeap->Size--];
     int Parent, Child;
     for (Parent = ; Parent *  <= MaxHeap->Size; Parent = Child)
     {
         Child = Parent * ;
         if (Child != MaxHeap->Size && MaxHeap->Heap[Child] < MaxHeap->Heap[Child + ])
             Child++;
         if (Tmp >= MaxHeap->Heap[Child])break;
         else
             MaxHeap->Heap[Parent] = MaxHeap->Heap[Child];
     }
     MaxHeap->Heap[Parent] = Tmp;
     return Max;
 }
 int DeleteM(H MinHeap)
 {
     int Min = MinHeap->Heap[];
     int Tmp = MinHeap->Heap[MinHeap->Size--];
     int Parent, Child;
     for (Parent = ; Parent *  <= MinHeap->Size; Parent = Child)
     {
         Child = Parent * ;
         if (Child != MinHeap->Size && MinHeap->Heap[Child]>MinHeap->Heap[Child + ])
             Child++;
         if (Tmp <= MinHeap->Heap[Child])break;
         else
             MinHeap->Heap[Parent] = MinHeap->Heap[Child];
     }
     MinHeap->Heap[Parent] = Tmp;
     return Min;
 }

 void PrecDown(H MaxHeap, int i)
 {
     int Parent, Child;
     int Tmp = MaxHeap->Heap[i];
     for (Parent = i; Parent *  <= MaxHeap->Size; Parent = Child)
     {
         Child = Parent * ;
         if (Child != MaxHeap->Size && MaxHeap->Heap[Child] < MaxHeap->Heap[Child + ])
             Child++;
         if (Tmp >= MaxHeap->Heap[Child])break;
         else
             MaxHeap->Heap[Parent] = MaxHeap->Heap[Child];
     }
     MaxHeap->Heap[Parent] = Tmp;
 }
 void BuildHeap(H MaxHeap)
 {
     for (int i = MaxHeap->Size / ; i; i /= )
         PrecDown(MaxHeap, i);
 }
 void PrecDownM(H MinHeap, int i)
 {
     int Parent, Child;
     int Tmp = MinHeap->Heap[i];
     for (Parent = i; Parent *  <= MinHeap->Size; Parent = Child)
     {
         Child = Parent * ;
         if (Child != MinHeap->Size && MinHeap->Heap[Child] > MinHeap->Heap[Child + ])
             Child++;
         if (Tmp <= MinHeap->Heap[Child])break;
         else
             MinHeap->Heap[Parent] = MinHeap->Heap[Child];
     }
     MinHeap->Heap[Parent] = Tmp;
 }
 void BuildHeapM(H MinHeap)
 {
     for (int i = MinHeap->Size / ; i; i /= )
         PrecDownM(MinHeap, i);
 }
 int main()
 {
     MaxHeap1.Heap[] = MaxHeap2.Heap[] = INIFITY;
     int N, M;
     int num,sum;
     scanf("%d", &N);
     MaxHeap1.Size = N;
     for (int i = ; i <=MaxHeap1.Size; i++)
     {
         scanf("%d", &num);
         MaxHeap1.Heap[i] = num;
     }
     scanf("%d", &M);
     MaxHeap2.Size = M;
     for (int i = ; i <=MaxHeap2.Size; i++)
     {
         scanf("%d", &num);
         MaxHeap2.Heap[i] = num;
     }
     BuildHeap(&MaxHeap1);
     BuildHeap(&MaxHeap2);
     sum = ;
     int num1, num2;
     int t = N > M ? M : N;
     while (MaxHeap1.Size!=&&MaxHeap2.Size!=)
     {
         if (MaxHeap1.Heap[] >  && MaxHeap2.Heap[] > )
         {
             num1 = Delete(&MaxHeap1);
             num2 = Delete(&MaxHeap2);
             sum += num1 * num2;
         }
         else
             break;
     }
     BuildHeapM(&MaxHeap1);
     BuildHeapM(&MaxHeap2);
     while (MaxHeap1.Size!=&&MaxHeap2.Size!=)
     {
         if (MaxHeap1.Heap[] <  && MaxHeap2.Heap[] < )
         {
             num1 = DeleteM(&MaxHeap1);
             num2 = DeleteM(&MaxHeap2);
             sum += num1 * num2;
         }
         else
             break;
     }
     printf("%d", sum);
 }