From 1d9b7de3986b79b886cb9ec744c3c9bff9025891 Mon Sep 17 00:00:00 2001
From: Jinyeong Seol <wlsdud5654@gmail.com>
Date: Tue, 11 Nov 2025 23:48:56 +0900
Subject: [PATCH] =?UTF-8?q?[20251111]=20BOJ=20/=20G4=20/=20=EC=A2=8B?=
 =?UTF-8?q?=EB=8B=A4=20/=20=EC=84=A4=EC=A7=84=EC=98=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...4 \354\242\213\353\213\244.md\342\200\216" | 58 +++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 "Seol-JY/202511/11 BOJ G4 \354\242\213\353\213\244.md\342\200\216"

diff --git "a/Seol-JY/202511/11 BOJ G4 \354\242\213\353\213\244.md\342\200\216" "b/Seol-JY/202511/11 BOJ G4 \354\242\213\353\213\244.md\342\200\216"
new file mode 100644
index 00000000..2762de18
--- /dev/null
+++ "b/Seol-JY/202511/11 BOJ G4 \354\242\213\353\213\244.md\342\200\216"	
@@ -0,0 +1,58 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        
+        int n = Integer.parseInt(br.readLine());
+        long[] arr = new long[n];
+        
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < n; i++) {
+            arr[i] = Long.parseLong(st.nextToken());
+        }
+        
+        Arrays.sort(arr);
+        
+        int count = 0;
+        for (int i = 0; i < n; i++) {
+            if (isGood(arr, n, i)) {
+                count++;
+            }
+        }
+        
+        System.out.println(count);
+    }
+    
+    static boolean isGood(long[] arr, int n, int target) {
+        int left = 0;
+        int right = n - 1;
+        long targetValue = arr[target];
+        
+        while (left < right) {
+            if (left == target) {
+                left++;
+                continue;
+            }
+            if (right == target) {
+                right--;
+                continue;
+            }
+            
+            long sum = arr[left] + arr[right];
+            
+            if (sum == targetValue) {
+                return true;
+            } else if (sum < targetValue) {
+                left++;
+            } else {
+                right--;
+            }
+        }
+        
+        return false;
+    }
+}
+```