From 32fc2d34e7eeea1fbb0b80c834f5c3a75396bd12 Mon Sep 17 00:00:00 2001
From: lkhyun <102892446+lkhyun@users.noreply.github.com>
Date: Thu, 13 Feb 2025 13:34:19 +0900
Subject: [PATCH] =?UTF-8?q?[20250213]=20BOJ=20/=20=EA=B3=A8=EB=93=9C5=20/?=
 =?UTF-8?q?=20=ED=9C=B4=EB=A8=BC=20=ED=8C=8C=EC=9D=B4=ED=94=84=EB=9D=BC?=
 =?UTF-8?q?=EC=9D=B8=20/=20=EC=9D=B4=EA=B0=95=ED=98=84?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...64\355\224\204\353\235\274\354\235\270.md" | 41 +++++++++++++++++++
 1 file changed, 41 insertions(+)
 create mode 100644 "lkhyun/202502/13 BOJ \352\263\250\353\223\2345 \355\234\264\353\250\274 \355\214\214\354\235\264\355\224\204\353\235\274\354\235\270.md"

diff --git "a/lkhyun/202502/13 BOJ \352\263\250\353\223\2345 \355\234\264\353\250\274 \355\214\214\354\235\264\355\224\204\353\235\274\354\235\270.md" "b/lkhyun/202502/13 BOJ \352\263\250\353\223\2345 \355\234\264\353\250\274 \355\214\214\354\235\264\355\224\204\353\235\274\354\235\270.md"
new file mode 100644
index 00000000..d98086d4
--- /dev/null
+++ "b/lkhyun/202502/13 BOJ \352\263\250\353\223\2345 \355\234\264\353\250\274 \355\214\214\354\235\264\355\224\204\353\235\274\354\235\270.md"	
@@ -0,0 +1,41 @@
+```java
+import java.util.*;
+import java.io.*;
+public class Main{
+    public static void main(String[] args) throws Exception{
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int N = Integer.parseInt(st.nextToken());
+        long K = Long.parseLong(st.nextToken());
+        int[] workSpeed = new int[N];
+        
+        st = new StringTokenizer(br.readLine());
+        for(int i=0;i<N;i++){
+            workSpeed[i] = Integer.parseInt(st.nextToken());
+        }
+        Arrays.sort(workSpeed);
+
+        int min = workSpeed[0]; //어느 한쪽 팀은 무조건 전체 속도의 최솟값을 가지게 될거임. 이를 a로 설정
+        int aTeamCount = 0;
+        int aTeamSpeed = min;
+        int bTeamCount = 0;
+        long bTeamSpeed = 0;
+        long totalSpeed = 0;
+        long maxSpeed = 0;
+        for(int i=1;i<N;i++){
+            bTeamSpeed = workSpeed[i]; // 작업 속도배열을 순회하며 하나씩 최솟값이 존재하지 않는 다른 팀의 하한으로 결정
+            aTeamCount = i;
+            bTeamCount = N-i;
+            /* 작업 속도는 정렬되어 있고 총 작업 속도의 최댓값을 찾는 것이 목적. 이때 작업속도의 최솟값이 존재하지
+             * 않는 bTeam의 작업자 입장에서는 ateam의 하한에 곱해질 바에 bteam의 하한에 곱해지는게 무조건 이득임.
+             */
+            totalSpeed = (long)aTeamCount*aTeamSpeed + bTeamCount*bTeamSpeed;
+            maxSpeed = Math.max(maxSpeed,totalSpeed);
+        }
+        bw.write((K+maxSpeed-1)/maxSpeed+"");
+        
+        bw.flush();
+    }
+}
+```