From 886d2eb2b7514b1c3850cc98dbf5223e97d8abbf Mon Sep 17 00:00:00 2001
From: Jonghwan Lee <123362165+0224LJH@users.noreply.github.com>
Date: Wed, 5 Nov 2025 22:33:27 +0900
Subject: [PATCH] =?UTF-8?q?[20251105]=20BOJ=20/=20G1=20/=20=EB=A9=80?=
 =?UTF-8?q?=ED=8B=B0=ED=83=AD=20=EC=8A=A4=EC=BC=80=EC=A4=84=EB=A7=81=20/?=
 =?UTF-8?q?=20=EC=9D=B4=EC=A2=85=ED=99=98?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...44\354\274\200\354\244\204\353\247\201.md" | 81 +++++++++++++++++++
 1 file changed, 81 insertions(+)
 create mode 100644 "0224LJH/202511/05 BOJ \353\251\200\355\213\260\355\203\255 \354\212\244\354\274\200\354\244\204\353\247\201.md"

diff --git "a/0224LJH/202511/05 BOJ \353\251\200\355\213\260\355\203\255 \354\212\244\354\274\200\354\244\204\353\247\201.md" "b/0224LJH/202511/05 BOJ \353\251\200\355\213\260\355\203\255 \354\212\244\354\274\200\354\244\204\353\247\201.md"
new file mode 100644
index 00000000..c41dd72c
--- /dev/null
+++ "b/0224LJH/202511/05 BOJ \353\251\200\355\213\260\355\203\255 \354\212\244\354\274\200\354\244\204\353\247\201.md"	
@@ -0,0 +1,81 @@
+```java
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+import java.util.HashSet;
+import java.util.StringTokenizer;
+
+public class Main { 
+	
+	static int size,totalLen,count;
+	static int[] arr;
+	static HashSet<Integer> set = new HashSet<>();
+	
+    public static void main(String[] args) throws IOException {
+    	init();
+    	process();
+    	print();
+    }
+
+    private static void init() throws IOException{
+    	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));;
+    	StringTokenizer st = new StringTokenizer(br.readLine());
+    	//이거 그냥 lfd 라는 페이지 교체 알고리즘을 쓰면 된다!
+    	size = Integer.parseInt(st.nextToken());
+    	totalLen = Integer.parseInt(st.nextToken());
+    	arr = new int[totalLen];
+    	
+    	st = new StringTokenizer(br.readLine());
+    	for (int i = 0; i <totalLen; i++) {
+    		arr[i] = Integer.parseInt(st.nextToken());
+    	}
+
+    	
+    }
+    
+    private static void process() {
+    	count = 0;
+
+    	
+    	for (int i = 0; i < totalLen; i++) {
+    		if (set.size() < size) {
+    			set.add(arr[i]);
+    			continue;
+    		}
+    		if (set.contains(arr[i])) continue;
+    		
+    		int target = -1;
+    		int targetDistance = 0;
+    		for (int num: set) {
+    			int distance = 10000;
+    			for (int j = i; j < totalLen; j++) {
+    				if (arr[j] == num) {
+    					distance = j-i;
+    					break;
+    				}
+    			}
+    			if (targetDistance < distance) {
+    				target = num;
+    				targetDistance = distance;
+    			}
+    		}
+    		
+    		count++;
+    		set.remove(target);
+    		set.add(arr[i]);
+    		
+    	}
+
+
+    }
+    
+
+    
+    private static void print() {
+    	System.out.println(count);
+    }
+}
+
+
+```