diff --git "a/Seol-JY/202511/27 BOJ G5 \354\204\240\353\260\234 \353\252\205\353\213\250.md\342\200\216" "b/Seol-JY/202511/27 BOJ G5 \354\204\240\353\260\234 \353\252\205\353\213\250.md\342\200\216"
new file mode 100644
index 00000000..ba509242
--- /dev/null
+++ "b/Seol-JY/202511/27 BOJ G5 \354\204\240\353\260\234 \353\252\205\353\213\250.md\342\200\216"	
@@ -0,0 +1,50 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static int N = 11;
+    static int[][] abilities;
+    static boolean[] visited;
+    static int maxAbility;
+
+    static void dfs(int position, int currentAbility) {
+        if (position == N) {
+            maxAbility = Math.max(maxAbility, currentAbility);
+            return;
+        }
+
+        for (int i = 0; i < N; i++) {
+            if (!visited[i] && abilities[i][position] > 0) {
+                visited[i] = true;
+                dfs(position + 1, currentAbility + abilities[i][position]);
+                visited[i] = false;
+            }
+        }
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st;
+        int T = Integer.parseInt(br.readLine());
+
+        for (int t = 0; t < T; t++) {
+            abilities = new int[N][N];
+            visited = new boolean[N];
+            maxAbility = 0;
+
+            for (int i = 0; i < N; i++) {
+                st = new StringTokenizer(br.readLine());
+                for (int j = 0; j < N; j++) {
+                    abilities[i][j] = Integer.parseInt(st.nextToken());
+                }
+            }
+
+            dfs(0, 0);
+            System.out.println(maxAbility);
+        }
+    }
+}
+
+```