From 08a12c644c54c3ebeb33170267e666b47a6ff2f9 Mon Sep 17 00:00:00 2001
From: oncsr <khj20006@naver.com>
Date: Tue, 13 Jan 2026 22:20:54 +0900
Subject: [PATCH] =?UTF-8?q?[20260113]=20BOJ=20/=20G1=20/=20=EC=9E=90?=
 =?UTF-8?q?=EB=A5=B4=EA=B8=B0=20/=20=EA=B6=8C=ED=98=81=EC=A4=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...1 \354\236\220\353\245\264\352\270\260.md" | 34 +++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 "khj20006/202601/13 BOJ G1 \354\236\220\353\245\264\352\270\260.md"

diff --git "a/khj20006/202601/13 BOJ G1 \354\236\220\353\245\264\352\270\260.md" "b/khj20006/202601/13 BOJ G1 \354\236\220\353\245\264\352\270\260.md"
new file mode 100644
index 00000000..006e3377
--- /dev/null
+++ "b/khj20006/202601/13 BOJ G1 \354\236\220\353\245\264\352\270\260.md"	
@@ -0,0 +1,34 @@
+```cpp
+#include <bits/stdc++.h>
+using namespace std;
+
+int N;
+int arr[1000002]{};
+int left_max1[1000002]{}, left_max2[1000002]{};
+int right_max1[1000002]{}, right_max2[1000002]{};
+
+int main() {
+    cin.tie(0)->sync_with_stdio(0);
+
+    cin>>N;
+    for(int i=1;i<=N;i++) cin>>arr[i];
+    for(int i=1;i<=N;i++) {
+        left_max1[i] = max(left_max1[i-1], arr[i]);
+        if(i>1) left_max2[i] = max(left_max2[i-1], arr[i]);
+    }
+    for(int i=N;i>=1;i--) {
+        right_max1[i] = max(right_max1[i+1], arr[i]);
+        if(i<N) right_max2[i] = max(right_max2[i+1], arr[i]);
+    }
+
+    int ans = 1e9;
+    for(int i=2;i<=N-2;i++) {
+        int left_result = min(arr[1] + left_max2[i], left_max1[i-1] + arr[i]);
+        int right_result = min(arr[i+1] + right_max1[i+2], right_max2[i+1] + arr[N]);
+        ans = min(ans, left_result + right_result);
+    }
+
+    cout<<ans;
+
+}
+```