Deep_Dev

https://school.programmers.co.kr/learn/courses/30/lessons/12941

 

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”.

programmers.co.kr

 

 


 

1. Arrays.sort() ์‚ฌ์šฉ

import java.util.*;

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

        Arrays.sort(A);
        Arrays.sort(B);

        int j = B.length-1;

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

        return answer;
    }
}

 

 

 

 

 

2. ์šฐ์„ ์ˆœ์œ„ ํ ์‚ฌ์šฉ

import java.util.*;

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

        PriorityQueue<Integer> a = new PriorityQueue<>();
        PriorityQueue<Integer> b = new PriorityQueue<>(Collections.reverseOrder());
        
        for(int i = 0; i< A.length; i++){
            a.add(A[i]);
            b.add(B[i]);
        }
        
        while(!a.isEmpty()){
            answer += a.poll() * b.poll();
        }
        
        return answer;
    }
}