BackJoon Algorithm - Java
문제
풀이
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Collections;
import java.util.StringTokenizer;
public class Back_1026 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine());
StringTokenizer st = new StringTokenizer(br.readLine());
Integer arrA[] = new Integer[N];
Integer arrB[] = new Integer[N];
for (int i = 0; i < N; i++) {
arrA[i] = Integer.parseInt(st.nextToken());
}
st = new StringTokenizer(br.readLine());
for (int i = 0; i < N; i++) {
arrB[i] = Integer.parseInt(st.nextToken());
}
Arrays.sort(arrA);
Arrays.sort(arrB, Collections.reverseOrder());
int sum = 0;
for (int i = 0; i < N; i++) {
sum += arrA[i] * arrB[i];
}
System.out.println(sum);
br.close();
}
}
댓글남기기