feat: add csharp solution to lc problem: No.2389 (#1895)

---------

Co-authored-by: Jahir509 <Jahir509@users.noreply.github.com>
Co-authored-by: Libin YANG <contact@yanglibin.info>

Author: Jahir509

solution/2300-2399/2389.Longest Subsequence With Limited Sum/README.md

@@ -311,6 +311,33 @@ impl Solution {
 }
 ```
 
+### **C#**
+
+```cs
+public class Solution {
+    public int[] AnswerQueries(int[] nums, int[] queries) {
+        int[] result = new int[queries.Length];
+        Array.Sort(nums);
+        for (int i = 0; i < queries.Length; i++) {
+            result[i] = getSubsequent(nums, queries[i]);
+        }
+        return result;
+
+    }
+
+    public int getSubsequent(int[] nums,int query) {
+        int sum = 0;
+        for (int i = 0; i < nums.Length; i++) {
+            sum += nums[i];
+            if (sum > query) {
+                return i;
+            }
+        }
+        return nums.Length;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2300-2399/2389.Longest Subsequence With Limited Sum/README_EN.md

@@ -279,6 +279,33 @@ impl Solution {
 }
 ```
 
+### **C#**
+
+```cs
+public class Solution {
+    public int[] AnswerQueries(int[] nums, int[] queries) {
+        int[] result = new int[queries.Length];
+        Array.Sort(nums);
+        for (int i = 0; i < queries.Length; i++) {
+            result[i] = getSubsequent(nums, queries[i]);
+        }
+        return result;
+
+    }
+
+    public int getSubsequent(int[] nums,int query) {
+        int sum = 0;
+        for (int i = 0; i < nums.Length; i++) {
+            sum += nums[i];
+            if (sum > query) {
+                return i;
+            }
+        }
+        return nums.Length;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2300-2399/2389.Longest Subsequence With Limited Sum/solution.cs

@@ -0,0 +1,22 @@
+public class Solution {
+    public int[] AnswerQueries(int[] nums, int[] queries) {
+        int[] result = new int[queries.Length];
+        Array.Sort(nums);
+        for (int i = 0; i < queries.Length; i++) {
+            result[i] = getSubsequent(nums, queries[i]);
+        }
+        return result;
+
+    }
+
+    public int getSubsequent(int[] nums,int query) {
+        int sum = 0;
+        for (int i = 0; i < nums.Length; i++) {
+            sum += nums[i];
+            if (sum > query) {
+                return i;
+            }
+        }
+        return nums.Length;
+    }
+}