[programmers] Lv2. 최솟값 만들기

import java.util.Arrays;

class Solution
{
    public int solution(int []A, int []B)
    {
        int answer = 0;

        Arrays.sort(A);
        Arrays.sort(B);
        
        for(int i=0; i<A.length; i++){
            answer += (A[i] * B[B.length-1-i]);
        }

        return answer;
    }
}