From 5cd4bd2256d41bd24ba9368ea4bade421a1632ca Mon Sep 17 00:00:00 2001 From: lkhyun <102892446+lkhyun@users.noreply.github.com> Date: Tue, 9 Sep 2025 19:40:43 +0900 Subject: [PATCH] =?UTF-8?q?[20250909]=20BOJ=20/=20G2=20/=20=EC=87=BC?= =?UTF-8?q?=ED=95=91=EB=AA=B0=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 --- ...2 \354\207\274\355\225\221\353\252\260.md" | 56 +++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 "lkhyun/202509/09 BOJ G2 \354\207\274\355\225\221\353\252\260.md" diff --git "a/lkhyun/202509/09 BOJ G2 \354\207\274\355\225\221\353\252\260.md" "b/lkhyun/202509/09 BOJ G2 \354\207\274\355\225\221\353\252\260.md" new file mode 100644 index 00000000..759cd2ff --- /dev/null +++ "b/lkhyun/202509/09 BOJ G2 \354\207\274\355\225\221\353\252\260.md" @@ -0,0 +1,56 @@ +```java + +import java.util.*; +import java.io.*; + +public class Main{ + static BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); + static StringTokenizer st; + static StringBuilder sb = new StringBuilder(); + static int N,K; + static PriorityQueue in; + static PriorityQueue out; + public static void main(String[] args) throws Exception { + st = new StringTokenizer(br.readLine()); + + N = Integer.parseInt(st.nextToken()); + K = Integer.parseInt(st.nextToken()); + + in = new PriorityQueue<>((a,b) -> { + if(a[0] == b[0]){ //시간이 같으면 + return Long.compare(a[1], b[1]); //적은 번호에 해당하는 곳 + }else{ + return Long.compare(a[0], b[0]); + } + }); + out = new PriorityQueue<>((a,b) -> { + if(a[0] == b[0]){ //시간이 같으면 + return Long.compare(b[1], a[1]); //큰 번호에 해당하는 곳 + }else{ + return Long.compare(a[0], b[0]); + } + }); + for (int i = 1; i <= K; i++) { + in.offer(new long[]{0,i}); + } + for (int i = 0; i < N; i++) { + st = new StringTokenizer(br.readLine()); + int num = Integer.parseInt(st.nextToken()); + int time = Integer.parseInt(st.nextToken()); + long[] insert = in.poll(); + insert[0] += time; + in.offer(insert); + out.offer(new long[]{insert[0],insert[1],num}); + } + + long ans = 0; + for (int i = 1; i <= N; i++) { + ans += i*out.poll()[2]; + } + bw.write(ans+""); + bw.close(); + } + +} +```