From 9e9da13105738fcce9f3f1d5a652f92b96285774 Mon Sep 17 00:00:00 2001
From: Jinyeong Seol <wlsdud5654@gmail.com>
Date: Sat, 1 Nov 2025 23:08:17 +0900
Subject: [PATCH] =?UTF-8?q?[20251101]=20BOJ=20/=20G1=20/=20=ED=95=A0=20?=
 =?UTF-8?q?=EC=9D=BC=20=EC=A0=95=ED=95=98=EA=B8=B0=201=20/=20=EC=84=A4?=
 =?UTF-8?q?=EC=A7=84=EC=98=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...\354\240\225\355\225\230\352\270\260 1.md" | 53 +++++++++++++++++++
 1 file changed, 53 insertions(+)
 create mode 100644 "Seol-JY/202511/1 BOJ G1 \355\225\240 \354\235\274 \354\240\225\355\225\230\352\270\260 1.md"

diff --git "a/Seol-JY/202511/1 BOJ G1 \355\225\240 \354\235\274 \354\240\225\355\225\230\352\270\260 1.md" "b/Seol-JY/202511/1 BOJ G1 \355\225\240 \354\235\274 \354\240\225\355\225\230\352\270\260 1.md"
new file mode 100644
index 00000000..45cb4804
--- /dev/null
+++ "b/Seol-JY/202511/1 BOJ G1 \355\225\240 \354\235\274 \354\240\225\355\225\230\352\270\260 1.md"	
@@ -0,0 +1,53 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static int N;
+    static int[][] cost;
+    static int[][] dp;
+    static final int INF = 987654321;
+    
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        
+        N = Integer.parseInt(br.readLine());
+        cost = new int[N][N];
+        
+        for (int i = 0; i < N; i++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            for (int j = 0; j < N; j++) {
+                cost[i][j] = Integer.parseInt(st.nextToken());
+            }
+        }
+        
+        dp = new int[N][1 << N];
+        for (int i = 0; i < N; i++) {
+            Arrays.fill(dp[i], -1);
+        }
+        
+        System.out.println(solve(0, 0));
+    }
+    
+    static int solve(int person, int mask) {
+        if (person == N) {
+            return 0;
+        }
+        
+        if (dp[person][mask] != -1) {
+            return dp[person][mask];
+        }
+        
+        int result = INF;
+        
+        for (int job = 0; job < N; job++) {
+            if ((mask & (1 << job)) == 0) {
+                int nextMask = mask | (1 << job);
+                result = Math.min(result, cost[person][job] + solve(person + 1, nextMask));
+            }
+        }
+        
+        return dp[person][mask] = result;
+    }
+}
+```