[Silver V] Title: Ski Course Design, Time: 144 ms, Memory: 10164 KB -BaekjoonHub

Author: choyeon2e

백준/Silver/9881. Ski Course Design/README.md

@@ -0,0 +1,28 @@
+# [Silver V] Ski Course Design - 9881 
+
+[문제 링크](https://www.acmicpc.net/problem/9881) 
+
+### 성능 요약
+
+메모리: 10164 KB, 시간: 144 ms
+
+### 분류
+
+브루트포스 알고리즘, 스위핑
+
+### 제출 일자
+
+2026년 2월 28일 15:17:51
+
+### 문제 설명
+
+<p>Farmer John has N hills on his farm (1 <= N <= 1,000), each with an integer elevation in the range 0 .. 100.  In the winter, since there is abundant snow on these hills, FJ routinely operates a ski training camp.</p><p>Unfortunately, FJ has just found out about a new tax that will be assessed next year on farms used as ski training camps.  Upon careful reading of the law, however, he discovers that the official definition of a ski camp requires the difference between the highest and lowest hill on his property to be strictly larger than 17.  Therefore, if he shortens his tallest hills and adds mass to increase the height of his shorter hills, FJ can avoid paying the tax as long as the new difference between the highest and lowest hill is at most 17.</p><p>If it costs x^2 units of money to change the height of a hill by x units, what is the minimum amount of money FJ will need to pay?  FJ is only willing to change the height of each hill by an integer amount.</p>
+
+### 입력 
+
+ <ul><li>Line 1: The integer N.</li><li>Lines 2..1+N: Each line contains the elevation of a single hill.</li></ul>
+
+### 출력 
+
+ <ul><li>Line 1: The minimum amount FJ needs to pay to modify the elevations of his hills so the difference between largest and smallest is at most 17 units.</li></ul>
+

백준/Silver/9881. Ski Course Design/Ski Course Design.js

@@ -0,0 +1,39 @@
+"use strict";
+
+const fs = require("fs");
+const input = fs
+  .readFileSync(process.platform === "linux" ? "/dev/stdin" : "./input.txt")
+  .toString()
+  .trim()
+  .split("\n");
+
+/**
+ * 목표: 가장 높은 언덕과 가장 낮은 언덕의 차이가 최대 17이 되게 언덕들의 높이 조정
+ * 이때 드는 최소비용 = ?
+ * 어떤 언덕의 높이를 x만큼 변경할 때 드는 비용: x^2
+ * 모든 언덕 높이는 정수로만 변경 가능
+ * 입력: 1번째 줄에는 정수 N, 2번째 줄부터 N+1번째 줄까지는 각 언덕의 높이
+ * 1<=N<=1000, 0<=height<=100
+ */
+
+const N = Number(input[0]);
+const hArr = input.slice(1, N + 1).map(Number);
+
+let minCost = Infinity;
+
+for (let low = 0; low <= 83; low++) {
+  let currentCost = 0;
+  const high = low + 17; //가능한 최대높이: low+17
+
+  for (let i = 0; i < N; i++) {
+    const height = hArr[i];
+    if (height < low) {
+      currentCost += (low - height) ** 2;
+    } else if (height > high) {
+      currentCost += (height - high) ** 2;
+    }
+  }
+  minCost = Math.min(minCost, currentCost);
+}
+
+console.log(minCost);