add: leetcode 2037 solution

leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone/2037.Minimum Number of Moves to Seat Everyone.go

@@ -0,0 +1,21 @@
+package leetcode
+
+import "sort"
+
+func minMovesToSeat(seats []int, students []int) int {
+	sort.Ints(seats)
+	sort.Ints(students)
+	n := len(students)
+	moves := 0
+	for i := 0; i < n; i++ {
+		moves += abs(seats[i], students[i])
+	}
+	return moves
+}
+
+func abs(a, b int) int {
+	if a > b {
+		return a - b
+	}
+	return b - a
+}