diff --git a/.obsidian/workspace.json b/.obsidian/workspace.json
index 3b8fbab7c..b80e20e16 100644
--- a/.obsidian/workspace.json
+++ b/.obsidian/workspace.json
@@ -150,8 +150,9 @@
   },
   "active": "9ffba651efc67257",
   "lastOpenFiles": [
-    "src/content/blog/boj-11057-.md",
     "src/content/blog/boj-1926-그림.md",
+    "src/content/blog/boj-11057-.md",
+    "src/content/blog/boj-11057-오르막-수.md",
     "src/content/blog/leet-code-letter-combinations-of-a-phone-number.md",
     "src/content/blog/leet-code-minimum-path-sum.md",
     "src/content/blog/boj-1940-주몽.md",
@@ -189,7 +190,6 @@
     "src/content/blog/boj-15664-N과-M-(10).md",
     "src/content/blog/boj-15663-N과-M-(9).md",
     "src/content/blog/boj-11728-배열-합치기.md",
-    "src/content/blog/boj-11057-오르막-수.md",
     "src/content/blog/boj-10819-차이를-최대로.md",
     "src/content/blog/boj-2230-수-고르기.md",
     "src/content/blog/boj-1912-연속합.md",
diff --git a/src/content/blog/boj-11057-.md b/src/content/blog/boj-11057-.md
deleted file mode 100644
index e69de29bb..000000000
diff --git "a/src/content/blog/boj-11057-\354\230\244\353\245\264\353\247\211-\354\210\230.md" "b/src/content/blog/boj-11057-\354\230\244\353\245\264\353\247\211-\354\210\230.md"
index 50a5a9086..3c7d6a910 100644
--- "a/src/content/blog/boj-11057-\354\230\244\353\245\264\353\247\211-\354\210\230.md"
+++ "b/src/content/blog/boj-11057-\354\230\244\353\245\264\353\247\211-\354\210\230.md"
@@ -19,6 +19,8 @@ ogImage: ""
 
 ## 들어가며
 
+걸린 시간: 39분
+
 이 문제는 완탐으로 풀려고 하면요.  
 무려 $10^{1000}$ 이라는 미친 가짓수가 나와서, 완탐으로는 못 풀어서 딴 풀이를 생각해야 합니다.