Level 2 최솟값 만들기

/* 최솟값 만들기

 * http://tryhelloworld.co.kr/challenge_codes/180

 */

import java.util.Arrays;

class TryHelloWorld {

public int getMinSum(int[] A, int[] B) {

int answer = 0;

int x=0;

int n=A.length;

int sum[] = new int[n*n];

int num1[]=new int[n];

int num2[]=new int[n];

Arrays.sort(A);//제일 작은값 0

Arrays.sort(B);//제일 작은값 0

for(int i=0; i<n; i++){

num1[i]=A[i];

}

for(int i=0; i<n; i++){

num2[i]=B[i];

}

for(int i=0; i<n; i++){

for(int j=n-1; j>=0; j--){

sum[x]=num1[i]*num2[j];

System.out.println("x = "+x+"  sum[x] = "+sum[x]);

x++;

}

}

for(int i=0; i<n; i++){

answer = answer+sum[(n+1)*i];

//System.out.println("answer = " +answer);

}

//System.out.println("answer = " +answer);

return answer;

}

public static void main(String[] args) {

TryHelloWorld test = new TryHelloWorld();

int[] A = {728, 1702, 97, 6375, 519, 5672, 7003, 1983, 5347, 4758};

int[] B = {3214, 1365, 2926, 7830, 5167, 8682, 7980, 2329, 8069, 8582};

System.out.println("마지막: "+test.getMinSum(A, B));

}

}