51. 2542. Maximum Subsequence Score

class Solution {
    public long maxScore(int[] nums1, int[] nums2, int k) {
        int arr[][] = new int[nums1.length][];
        for(int i =0;i<nums1.length;i++){
            arr[i]= new int[]{nums1[i],nums2[i]};
        }
        //sort the array according to nums2 - desc
        Arrays.sort(arr,(a,b)->(b[1]-a[1]));
        long sum=0;
        long ans = 0;
        Queue<Integer> pq = new PriorityQueue<>();
        for(int i=0;i<nums1.length;i++){
            if(i<k){
                sum += arr[i][0];
            }else {
                sum = sum + arr[i][0]-pq.poll();
            }
            pq.add(arr[i][0]);
            if(pq.size()==k){
                ans = Math.max(ans,sum*arr[i][1]);
            }
        }
        return ans;
    }
}