From 270c2b4394b904f8b15ec8a65c4ecfa59bf111cc Mon Sep 17 00:00:00 2001
From: oncsr <khj20006@naver.com>
Date: Mon, 10 Feb 2025 13:13:04 +0900
Subject: [PATCH] =?UTF-8?q?[20250210]=20BOJ=20/=20=EC=8B=A4=EB=B2=843=20/?=
 =?UTF-8?q?=20=EC=B9=9C=EA=B5=AC=EC=99=80=20=EB=B0=B0=EB=8B=AC=ED=95=98?=
 =?UTF-8?q?=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

---
 ...60\353\213\254\355\225\230\352\270\260.md" | 81 +++++++++++++++++++
 1 file changed, 81 insertions(+)
 create mode 100644 "khj20006/202502/10 BOJ S3 \354\271\234\352\265\254\354\231\200 \353\260\260\353\213\254\355\225\230\352\270\260.md"

diff --git "a/khj20006/202502/10 BOJ S3 \354\271\234\352\265\254\354\231\200 \353\260\260\353\213\254\355\225\230\352\270\260.md" "b/khj20006/202502/10 BOJ S3 \354\271\234\352\265\254\354\231\200 \353\260\260\353\213\254\355\225\230\352\270\260.md"
new file mode 100644
index 00000000..79aa4159
--- /dev/null
+++ "b/khj20006/202502/10 BOJ S3 \354\271\234\352\265\254\354\231\200 \353\260\260\353\213\254\355\225\230\352\270\260.md"	
@@ -0,0 +1,81 @@
+```java
+
+import java.util.*;
+import java.io.*;
+
+class Main {
+	
+	// IO field
+	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+	static StringTokenizer st;
+
+	static void nextLine() throws Exception {st = new StringTokenizer(br.readLine());}
+	static int nextInt() {return Integer.parseInt(st.nextToken());}
+	static long nextLong() {return Long.parseLong(st.nextToken());}
+	static void bwEnd() throws Exception {bw.flush();bw.close();}
+	
+	// Additional field
+	static int T, N, PA, PB;
+	static long[] A;
+	
+	public static void main(String[] args) throws Exception {
+		
+		ready();
+		//solve();
+	
+		bwEnd();
+	}
+	
+	static void ready() throws Exception{
+		
+		T = Integer.parseInt(br.readLine());
+		while(T-- > 0) {
+			nextLine();
+			N = nextInt();
+			PA = nextInt();
+			PB = nextInt();
+			if(PA > PB) {
+				int temp = PA;
+				PA = PB;
+				PB = temp;
+			}
+			A = new long[N];
+			nextLine();
+			for(int i=0;i<N;i++) A[i] = nextInt();
+			solve();
+		}
+		
+	}
+	
+	static void solve() throws Exception{
+		
+		Arrays.sort(A);
+		long ans = 0, res = 0, mid = -1, cnt = 0;
+		for(long i:A) {
+			if(i-PA < PB-i) {
+				ans += (i-PA) * 2;
+				res += (i-PA) * 2;
+			}
+			else if(i-PA == PB-i) {
+				ans += (i-PA) * 2;
+				mid = i;
+				cnt++;
+			}
+			else{
+				ans += (PB-i) * 2;
+				res -= (PB-i) * 2;
+			}
+		}
+		if(mid != -1) {
+			long res2 = Long.MAX_VALUE;
+			for(long i=0;i<=cnt;i++) res2 = Math.min(res2, Math.abs(res+2*(mid-PA)*(2*i-cnt)));
+			res = res2;
+		}
+		res = Math.abs(res);
+		bw.write(ans + " " + res + "\n");
+	}
+	
+}
+
+```