이슈 #418에서 솔루션 추가

Author: actions-user

Programmers/피로도.txt

@@ -0,0 +1,26 @@
+++
+#include <string>
+#include <vector>
+
+using namespace std;
+
+int answer = 0;
+bool visited[8] = {false};
+
+void dfs(int cnt, int k, vector<vector<int>> &dungeons) {
+    if (cnt > answer) answer = cnt;
+    
+    for (int i = 0; i < dungeons.size(); i++) {
+        if (!visited[i] && dungeons[i][0] <= k) {
+            visited[i] = true;
+            dfs(cnt + 1, k - dungeons[i][1], dungeons);
+            visited[i] = false;
+        }
+    }
+}
+
+int solution(int k, vector<vector<int>> dungeons) {
+    dfs(0, k, dungeons);
+    
+    return answer;
+}