From 376c7ea776200127a1a9dae2bd9f973b5e90111e Mon Sep 17 00:00:00 2001
From: lkhyun <102892446+lkhyun@users.noreply.github.com>
Date: Thu, 25 Sep 2025 21:01:10 +0900
Subject: [PATCH] =?UTF-8?q?[20250925]=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=9D=B4?=
 =?UTF-8?q?=EA=B0=95=ED=98=84?=
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" | 49 +++++++++++++++++++
 1 file changed, 49 insertions(+)
 create mode 100644 "lkhyun/202509/25 BOJ G1 \355\225\240 \354\235\274 \354\240\225\355\225\230\352\270\260 1.md"

diff --git "a/lkhyun/202509/25 BOJ G1 \355\225\240 \354\235\274 \354\240\225\355\225\230\352\270\260 1.md" "b/lkhyun/202509/25 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..2e66d7d8
--- /dev/null
+++ "b/lkhyun/202509/25 BOJ G1 \355\225\240 \354\235\274 \354\240\225\355\225\230\352\270\260 1.md"	
@@ -0,0 +1,49 @@
+```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;
+    static int[][] works;
+    static int[][] dp; //dp[i][j] = i번째 사람까지 고려하고 j의 일 상태일때 최소비용
+
+    public static void main(String[] args) throws Exception {
+        N = Integer.parseInt(br.readLine());
+        works = new int[N+1][N+1];
+
+        for (int i = 1; i <= N; i++) {
+            st = new StringTokenizer(br.readLine());
+            for (int j = 1; j <= N; j++) {
+                works[i][j] = Integer.parseInt(st.nextToken());
+            }
+        }
+
+        dp = new int[N+1][1<<N];
+
+        for (int i = 0; i <= N; i++) {
+            Arrays.fill(dp[i], Integer.MAX_VALUE);
+        }
+        dp[0][0] = 0;
+
+        for (int i = 1; i <= N; i++) {
+            for (int mask = 0; mask < (1<<N); mask++) {
+                for (int j = 1; j <= N; j++) {
+                    if((mask & 1<<(j-1)) != 0){ // i가 일할라는데 j번째 일을 누가 한 경우에만 비교
+                        int prevMask = mask ^ 1<<(j-1); //j번째 일 비할당으로 만들기
+                        if(dp[i-1][prevMask] != Integer.MAX_VALUE){
+                            dp[i][mask] = Math.min(dp[i][mask], dp[i-1][prevMask] + works[i][j]);
+                        }
+                    }
+                }
+            }
+        }
+        bw.write(dp[N][(1<<N)-1]+""); 
+        bw.close();
+    }
+    
+}
+```