PAT-A1037

来源：互联网发布：淘宝服装店铺文案编辑：程序博客网时间：2024/04/30 08:17
#include<stdio.h>#include<algorithm>using namespace std;int nn[100010], mm[100010];bool cmp( int a,int b){return a>b;}int main(){int i, j, n, m, z=0, f=0;long long sum=0;scanf("%d",&n);for(i=0;i<n;i++){scanf("%d",&nn[i]);}scanf("%d",&m);for(i=0;i<m;i++){scanf("%d",&mm[i]);}sort(nn,nn+n);sort(mm,mm+m);for(i=0,j=0;i<n,j<m;i++,j++){if(nn[i]<0&&mm[j]<0){f=i; sum+=nn[i]*mm[i];}else break;}for(i=n-1,j=m-1;i>=0,j>=0;i--,j--){if(nn[i]>0&&mm[j]>0){z=i; sum+=nn[i]*mm[j];}else break;}printf("%d\n",sum);return 0;}/*#include<stdio.h>#include<algorithm>using namespace std;int nn[1000010], mm[1000010];bool cmp( int a,int b){if(a!=b)return a>b;  else return a<b;/////////////////////////////////////}int main(){int i, j, n, m, z=0, f=0;long long sum=0;scanf("%d",&n);for(i=0;i<n;i++){scanf("%d",&nn[i]);}scanf("%d",&m);for(i=0;i<m;i++){scanf("%d",&mm[i]);}sort(nn,nn+n,cmp);sort(mm,mm+m,cmp);for(i=0,j=0;i<n,j<m;i++,j++){if(nn[i]>0&&mm[j]>0){f=i; sum+=nn[i]*mm[i];}else break;}for(i=n-1,j=m-1;i>=0,j>=0;i--,j--){if(nn[i]<0&&mm[j]<0){z=i; sum+=nn[i]*mm[j];}else break;}printf("%d\n",sum);return 0;}*/
0 0