![](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FdGjSNu%2FbtrgB4t0EXd%2FmMKqK1Onc3Ns9s3mi5pxG0%2Fimg.png)
[백준] 2217.로프(Java8)
·
알고리즘/Java
문제 풀이 package greedy; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; public class Main { public static void main(String[] args) throws IOException{ // 로프 BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine());//로프의 개수 int[] arr = new int[n];//각 로프의 최대 중량 for(int i = 0..