diff --git a/Dynamic_Programming/2403.Minimum-Time-to-Kill-All-Monsters/2403.Minimum-Time-to-Kill-All-Monsters.cpp b/Dynamic_Programming/2403.Minimum-Time-to-Kill-All-Monsters/2403.Minimum-Time-to-Kill-All-Monsters.cpp
new file mode 100644
index 000000000..eb6a77b17
--- /dev/null
+++ b/Dynamic_Programming/2403.Minimum-Time-to-Kill-All-Monsters/2403.Minimum-Time-to-Kill-All-Monsters.cpp
@@ -0,0 +1,20 @@
+using LL = long long;
+class Solution {
+public:
+ long long minimumTime(vector<int>& power) 
+ {
+ int n = power.size();
+ vector<ll>dp(1<<n, LLONG_MAX/2); + dp[0] = 0; + for (int state = 1; state < (1<<n); state++) + { + int k = __builtin_popcount(state); + for (int i=0; i<n; i++) + { + if ((state>>i)&1) 
+ dp[state] = min(dp[state], dp[state- (1<<i)] + (power[i]-1)/k+1); 
+ }
+ }
+ return dp[(1<<n)-1]; 
+ }
+};
diff --git a/Dynamic_Programming/2403.Minimum-Time-to-Kill-All-Monsters/Readme.md b/Dynamic_Programming/2403.Minimum-Time-to-Kill-All-Monsters/Readme.md
new file mode 100644
index 000000000..9f83e4c79
--- /dev/null
+++ b/Dynamic_Programming/2403.Minimum-Time-to-Kill-All-Monsters/Readme.md
@@ -0,0 +1,16 @@
+### 2403.Minimum-Time-to-Kill-All-Monsters
+
+本题首先需要知道,并不是将monster按照从小到大排序就是最优解。Example 1 就是一个反例。考虑到monster的个数只有17,说明所有的状态数是`2^17=131072`,使用状态压缩dp的复杂度是可以接受的。
+
+我们令二进制数state表示哪些怪兽被消灭,dp[state]表示消灭这些怪兽所需要的最少天数,因此状态转移方程取决于state里面哪一个是最后一只被消灭的怪兽,穷举一下即可:
+```cpp
+int k = __builtin_popcount(state); // state所对应的怪兽数目
+for (int i=0; i<n; i++)
+{ 
+ if (bit i属于state的子集)
+ dp[state] = min{ dp[state - (1<<i)] + 怪兽i作为第k个目标所需要花费的时间}
+}
+```
+最后返回`dp[(1<<n)-1]`.
+
+整体的时间复杂度是`2^17*17 = 2e6`。
diff --git a/Readme.md b/Readme.md
index 21ae6ac95..740a76c7c 100644
--- a/Readme.md
+++ b/Readme.md
@@ -791,6 +791,7 @@
 [1931.Painting-a-Grid-With-Three-Different-Colors](https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1931.Painting-a-Grid-With-Three-Different-Colors) (M+) 
 [1994.The-Number-of-Good-Subsets](https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1994.The-Number-of-Good-Subsets) (H) 
 [2184.Number-of-Ways-to-Build-Sturdy-Brick-Wall](https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/2184.Number-of-Ways-to-Build-Sturdy-Brick-Wall) (H-) 
+[2403.Minimum-Time-to-Kill-All-Monsters](https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/2403.Minimum-Time-to-Kill-All-Monsters) (M+) 
 * ``枚举集合的子集`` 
 [1494.Parallel-Courses-II](https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1494.Parallel-Courses-II) (H) 
 [1655.Distribute-Repeating-Integers](https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1655.Distribute-Repeating-Integers) (H) 
</div><div class="naked_ctrl">
<form action="/index.cgi/contrast" method="get" name="gate">
<p><a href="http://altstyle.alfasado.net">AltStyle</a> によって変換されたページ <a href="https://patch-diff.githubusercontent.com/raw/AlgorithmAndLeetCode/wisdompeak_LeetCode/pull/83.diff">(-&gt;オリジナル)</a>
/ <label>アドレス: <input type="text" name="naked_post_url" value="https://patch-diff.githubusercontent.com/raw/AlgorithmAndLeetCode/wisdompeak_LeetCode/pull/83.diff" size="22" /></label> <label>モード: <select name="naked_post_mode">
<option value="default">デフォルト</option>
<option value="speech">音声ブラウザ</option>
<option value="ruby">ルビ付き</option>
<option value="contrast" selected="selected">配色反転</option>
<option value="larger-text">文字拡大</option>
<option value="mobile">モバイル</option>
</select>
<input type="submit" value="表示" />
</p>
</form>
</div>