-------------------------------------------------------------------------------------------------------------------------------
import java.io.*;
public class maxim{
private static int[] a=new int[30];
private static int[] b=new int[30];
private static int m,n,i;
private static long E;
private static void sort(int k, int[] x){
int inv,man;
do{
inv=0;
for(i=1;i<=k-1;i++)
if(x[i]>x[i+1]){
man=x[i];x[i]=x[i+1];x[i+1]=man;inv=1;
}
}while(inv==1);
}
public static void main(String[] args){
try{
BufferedReader input = new BufferedReader(new InputStreamReader(System.in) );
System.out.print("m="); m=Integer.parseInt(input.readLine());
for(i=1;i<=m;i++) a[i]=Integer.parseInt(input.readLine());
System.out.print("n="); n=Integer.parseInt(input.readLine());
for(i=1;i<=n;i++) b[i]=Integer.parseInt(input.readLine());
sort(m,a);sort(n,b);
for(i=1;i<=m;i++)
if(a[i]<0)
E+=a[i]*b[i];
else
E+=a[i]*b[n-m+i];
System.out.println(E);
}catch(Exception e){e.printStackTrace();}
}
}
-------------------------------------------------------------------------------------------------------------------------------

0 comments:
Post a Comment