刷题记录

Pat 刷题记录

Magic Coupon (25) 甲级
题目没有什么坑，相对简单

#include "stdio.h"
#include "iostream"
#include "algorithm"
using namespace std;
   int main(){   
           int m,n;   
           long long int A[100005];   
           long long int B[100005];   
           long long int count=0;   
           int num=0,num1=0;   
           int low=0,low1=0;   
           scanf("%d",&m);   
      for(int i=0;i<m;i++)   
         {    scanf("%lld",&A[i]);   }  
         scanf("%d",&n);   
      for(int i=0;i<n;i++)   
      {   scanf("%lld",&B[i]);   }   
         sort(A,A+m);   
         sort(B,B+n);   
         num=m-1;   
         num1=n-1;  
         while(A[num]*B[num1]>0)   
         {   count=count+A[num]*B[num1];   num--;   num1--;   }  
         if(num>0&&num1>0)  
         {  while(A[low]*B[low1]>0)  
         {  count=count+A[low]*B[low1];  low++;  low1++;  }  }
         printf("%lld",count);}