add 2099

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2099|[Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2099.java) ||Easy||
 |2095|[Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2095.java) ||Medium||
 |2094|[Finding 3-Digit Even Numbers](https://leetcode.com/problems/finding-3-digit-even-numbers/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2094.java) ||Easy||
 |2091|[Removing Minimum and Maximum From Array](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2091.java) ||Medium||

src/main/java/com/fishercoder/solutions/_2099.java

@@ -0,0 +1,27 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _2099 {
+    public static class Solution1 {
+        public int[] maxSubsequence(int[] nums, int k) {
+            int[][] map = new int[nums.length][2];
+            for (int i = 0; i < nums.length; i++) {
+                map[i][0] = nums[i];
+                map[i][1] = i;
+            }
+            Arrays.sort(map, (a, b) -> b[0] - a[0]);
+            int[][] arr = new int[k][2];
+            for (int i = 0; i < k; i++) {
+                arr[i][0] = map[i][0];
+                arr[i][1] = map[i][1];
+            }
+            Arrays.sort(arr, (a, b) -> a[1] - b[1]);
+            int[] ans = new int[k];
+            for (int i = 0; i < k; i++) {
+                ans[i] = arr[i][0];
+            }
+            return ans;
+        }
+    }
+}