diff --git a/Kaifeel/README.md b/Kaifeel/README.md
index d1ab9d6..4e79f30 100644
--- a/Kaifeel/README.md
+++ b/Kaifeel/README.md
@@ -7,3 +7,5 @@
 | 5차시 | 2026.07.01 | <a href="https://jungol.co.kr/problem/2191">최소 편집 | <a href="https://github.com/AlgoLeadMe/AlgoLeadMe-16/pull/32"> #32|
 | 6차시 | 2026.07.07 | <a href="https://www.codetree.ai/ko/trails/complete/curated-cards/challenge-tromino/description">트로미노 | <a href="https://github.com/AlgoLeadMe/AlgoLeadMe-16/pull/35"> #35|
 | 7차시 | 2026.07.13 | <a href="https://web.archive.org/web/20260421150151/https://www.acmicpc.net/problem/17472">다리만들기 2 | <a href="https://github.com/AlgoLeadMe/AlgoLeadMe-16/pull/36"> #36|
+| 8차시 | 2026.08.10| <a href="https://leetcode.com/problems/maximal-rectangle/description/">Maximal Rectangle | <a href="https://github.com/AlgoLeadMe/AlgoLeadMe-16/pull/37"> #37|
+| 9차시 | 2026.08.16| <a href="https://atcoder.jp/contests/abc471/tasks/abc471_c">Cookies and Greedy Takahashi | <a href="https://github.com/AlgoLeadMe/AlgoLeadMe-16/pull/39"> #39|
diff --git "a/Kaifeel/\352\265\254\355\230\204/Cookies and Greedy Takahashi.cpp" "b/Kaifeel/\352\265\254\355\230\204/Cookies and Greedy Takahashi.cpp"
new file mode 100644
index 0000000..fec4eab
--- /dev/null
+++ "b/Kaifeel/\352\265\254\355\230\204/Cookies and Greedy Takahashi.cpp"	
@@ -0,0 +1,60 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <climits>
+
+using namespace std;
+typedef long long ll;
+
+int main()
+{
+	int n;
+	cin >> n;
+	vector<ll> plus;
+
+	vector<ll> minus;
+
+	while (n--)
+	{
+		ll num;
+		cin >> num;
+		if (num > 0)
+			plus.push_back(num);
+		else
+			minus.push_back(num);
+	}
+
+	sort(plus.begin(), plus.end());
+	sort(minus.rbegin(), minus.rend());
+
+	int i = 0, j = 0;
+	ll ans = 0;
+	ll cur = 0;
+
+	while (i != minus.size() || j != plus.size())
+	{
+
+		ll leftD = LLONG_MAX;
+		ll rightD = LLONG_MAX;
+
+		if (i < minus.size())
+			leftD = abs(minus[i] - cur);
+		if (j < plus.size())
+			rightD = abs(plus[j] - cur);
+
+		if (leftD <= rightD)
+		{
+			ans += leftD;
+			cur = minus[i];
+			i++;
+		}
+		else
+		{
+			ans += rightD;
+			cur = plus[j];
+			j++;
+		}
+	}
+
+	cout << ans;
+}
\ No newline at end of file