JAVA || EASY TO UNDERSATND || NO HASH
\n    public int[] maxSubsequence(int[] nums, int k) {\n      PriorityQueue<Integer> pq=new PriorityQueue<>();\n       List<Integer> v=new ArrayList<>(); \n    
```\n    public int[] maxSubsequence(int[] nums, int k) {\n      PriorityQueue<Integer> pq=new PriorityQueue<>();\n       List<Integer> v=new ArrayList<>(); \n        for(int x:nums){\n            pq.add(x);\n            v.add(x);\n        }\n        \n        int[] ans=new int[k];\n        \n        for(int i=0;i<nums.length-k;i++)\n            v.remove(pq.remove());\n        \n        for(int i=0;i<k;i++)\n            ans[i]=v.get(i);\n        \n        return ans;\n    }\n```
['Java']