diff --git "a/Seol-JY/202511/18 BOJ G4 \354\204\234\354\232\270\354\227\220\354\204\234 \352\262\275\354\202\260\352\271\214\354\247\200.md\342\200\216" "b/Seol-JY/202511/18 BOJ G4 \354\204\234\354\232\270\354\227\220\354\204\234 \352\262\275\354\202\260\352\271\214\354\247\200.md\342\200\216"
new file mode 100644
index 00000000..861dbf33
--- /dev/null
+++ "b/Seol-JY/202511/18 BOJ G4 \354\204\234\354\232\270\354\227\220\354\204\234 \352\262\275\354\202\260\352\271\214\354\247\200.md\342\200\216"	
@@ -0,0 +1,59 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        
+        int N = Integer.parseInt(st.nextToken());
+        int K = Integer.parseInt(st.nextToken());
+        
+        int[][] segments = new int[N][4];
+        for (int i = 0; i < N; i++) {
+            st = new StringTokenizer(br.readLine());
+            for (int j = 0; j < 4; j++) {
+                segments[i][j] = Integer.parseInt(st.nextToken());
+            }
+        }
+        
+        int[] dp = new int[K + 1];
+        Arrays.fill(dp, -1);
+        dp[0] = 0;
+        
+        for (int i = 0; i < N; i++) {
+            int walkTime = segments[i][0];
+            int walkMoney = segments[i][1];
+            int bikeTime = segments[i][2];
+            int bikeMoney = segments[i][3];
+            
+            int[] newDp = new int[K + 1];
+            Arrays.fill(newDp, -1);
+            
+            for (int t = 0; t <= K; t++) {
+                if (dp[t] == -1) continue;
+                
+                if (t + walkTime <= K) {
+                    newDp[t + walkTime] = Math.max(newDp[t + walkTime], dp[t] + walkMoney);
+                }
+                
+                if (t + bikeTime <= K) {
+                    newDp[t + bikeTime] = Math.max(newDp[t + bikeTime], dp[t] + bikeMoney);
+                }
+            }
+            
+            dp = newDp;
+        }
+        
+        int answer = 0;
+        for (int t = 0; t <= K; t++) {
+            if (dp[t] != -1) {
+                answer = Math.max(answer, dp[t]);
+            }
+        }
+        
+        System.out.println(answer);
+    }
+}
+```