https://leetcode.cn/problems/minimum-number-of-moves-to-seat-everyone/

Author: masx200

README.md

@@ -49,6 +49,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/minimum-number-of-moves-to-seat-everyone/
+
 https://leetcode.cn/problems/time-needed-to-inform-all-employees
 
 https://leetcode.cn/problems/rotting-oranges

minimum-number-of-moves-to-seat-everyone/index.ts

@@ -0,0 +1,9 @@
+export default function minMovesToSeat(
+    seats: number[],
+    students: number[],
+): number {
+    seats.sort((a, b) => a - b);
+    students.sort((a, b) => a - b);
+
+    return seats.reduce((p, c, i) => p + Math.abs(c - students[i]), 0);
+}