From 5c30cf3ec0d2397e85bb82dcd4ca99849c22acf0 Mon Sep 17 00:00:00 2001
From: oncsr <khj20006@naver.com>
Date: Mon, 10 Feb 2025 13:35:48 +0900
Subject: [PATCH] =?UTF-8?q?[20250210]=20BOJ=20/=20=ED=94=8C=EB=9E=985=20/?=
 =?UTF-8?q?=20Class=20Schedule=20/=20=EA=B6=8C=ED=98=81=EC=A4=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 khj20006/202502/10 BOJ P5 Class Schedule.md | 78 +++++++++++++++++++++
 1 file changed, 78 insertions(+)
 create mode 100644 khj20006/202502/10 BOJ P5 Class Schedule.md

diff --git a/khj20006/202502/10 BOJ P5 Class Schedule.md b/khj20006/202502/10 BOJ P5 Class Schedule.md
new file mode 100644
index 00000000..507a2a33
--- /dev/null
+++ b/khj20006/202502/10 BOJ P5 Class Schedule.md	
@@ -0,0 +1,78 @@
+```java
+
+import java.util.*;
+import java.io.*;
+
+class Main {
+	
+	// IO field
+	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+	static StringTokenizer st;
+
+	static void nextLine() throws Exception {st = new StringTokenizer(br.readLine());}
+	static int nextInt() {return Integer.parseInt(st.nextToken());}
+	static long nextLong() {return Long.parseLong(st.nextToken());}
+	static void bwEnd() throws Exception {bw.flush();bw.close();}
+	
+	// Additional field
+	static int[] dp;
+	static int[][] E, P;
+	static int C, T, L;
+	
+	public static void main(String[] args) throws Exception {
+		
+		ready();
+		//solve();
+	
+		bwEnd();
+	}
+	
+	static void ready() throws Exception{
+
+		int Z = Integer.parseInt(br.readLine());
+		while(Z-- > 0) {
+			nextLine();
+			C = nextInt();
+			T = nextInt();
+			L = nextInt();
+			dp = new int[T];
+			E = new int[C][T];
+			P = new int[C][T];
+			for(int i=0;i<C;i++) {
+				for(int j=0;j<T;j++) {
+					nextLine();
+					P[i][j] = nextInt();
+					E[i][j] = nextInt();
+				}
+			}
+			
+			solve();
+		}
+		
+	}
+	
+	static void solve() throws Exception{
+
+		for(int j=0;j<T;j++) dp[j] = P[0][j] + E[0][j];
+		
+		for(int i=1;i<C;i++) {
+			int[] ndp = new int[T];
+			Arrays.fill(ndp, Integer.MAX_VALUE);
+			for(int j=0;j<T;j++) {
+				for(int k=0;k<T;k++) {
+					ndp[j] = Math.min(ndp[j], dp[k] + E[i][j] + Math.abs(P[i][j] - P[i-1][k]));
+				}
+			}
+			dp = ndp;
+		}
+		
+		int ans = Integer.MAX_VALUE;
+		for(int j=0;j<T;j++) ans = Math.min(ans, dp[j] + Math.abs(L-P[C-1][j]));
+		bw.write(ans+"\n");
+		
+	}
+	
+}
+
+```