diff --git a/solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/README.md b/solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/README.md
index 97d3fc1ae73b0..731e7a74364ca 100644
--- a/solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/README.md	
+++ b/solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/README.md	
@@ -136,6 +136,21 @@ function minPairSum(nums: number[]): number {
 }
 ```
 
+### **C#**
+
+```cs
+public class Solution {
+    public int MinPairSum(int[] nums) {
+        Array.Sort(nums);
+        int ans = 0, n = nums.Length;
+        for (int i = 0; i < n >> 1; ++i) {
+            ans = Math.Max(ans, nums[i] + nums[n - i - 1]);
+        }
+        return ans;
+    }
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/README_EN.md b/solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/README_EN.md
index 5e5fc9ecf766c..9b78d50ee6865 100644
--- a/solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/README_EN.md	
+++ b/solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/README_EN.md	
@@ -122,6 +122,21 @@ function minPairSum(nums: number[]): number {
 }
 ```
 
+### **C#**
+
+```cs
+public class Solution {
+    public int MinPairSum(int[] nums) {
+        Array.Sort(nums);
+        int ans = 0, n = nums.Length;
+        for (int i = 0; i < n >> 1; ++i) {
+            ans = Math.Max(ans, nums[i] + nums[n - i - 1]);
+        }
+        return ans;
+    }
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/Solution.cs b/solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/Solution.cs
new file mode 100644
index 0000000000000..8cf09c4e28549
--- /dev/null
+++ b/solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/Solution.cs	
@@ -0,0 +1,10 @@
+public class Solution {
+    public int MinPairSum(int[] nums) {
+        Array.Sort(nums);
+        int ans = 0, n = nums.Length;
+        for (int i = 0; i < n >> 1; ++i) {
+            ans = Math.Max(ans, nums[i] + nums[n - i - 1]);
+        }
+        return ans;
+    }
+}