add new solutions

solutions/18/q1877/solution.go

@@ -0,0 +1,16 @@
+package q1877
+
+import "slices"
+
+func minPairSum(nums []int) int {
+	slices.Sort(nums)
+	n := len(nums)
+
+	maxSum := 0
+	for i := range n / 2 {
+		maxSum = max(maxSum, nums[i]+nums[n-1-i])
+	}
+	return maxSum
+}
+
+var _ = minPairSum