너T야? 나 T(story)야….

import java.util.PriorityQueue;import java.util.Scanner;public class BJ1715 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int result =0; PriorityQueue pq = new PriorityQueue(); for (int i = 0; i 1) { int first = pq.poll(); int second = pq.poll(); result += (first + seco..

import java.util.Scanner;import java.util.Arrays;public class BJ2217 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int[] ropes = new int[N]; for (int i = 0; i  weight를 크기에 따라 나누고 최대를 구하면 된다.