//错误的代码
class Solution {
    public long maxScore(int[] nums1, int[] nums2, int k) {
        int n = nums1.length;
        int[][] nums = new int[n][2];
        for(int i = 0; i < n; ++i){
            nums[i][0] = nums1[i];
            nums[i][1] = nums2[i];
        }
        Arrays.sort(nums, (a, b) -> b[1] - a[1]);
        PriorityQueue<Integer> q = new PriorityQueue<Integer>();
        int i = 0;
        long sum = 0;
        int min = Integer.MAX_VALUE;
        while(k > 0){
            sum += nums[i][0];
            min = Math.min(min, nums[i][1]);
            q.offer(nums[i][0]);
            k--;
            i++;
        }
        long ans = 0;
        ans = sum * min;
        for(; i < n; ++i){
            if((long)(sum - q.peek() + nums[i][0]) * nums[i][1] >= ans){
                sum = sum - q.poll() + nums[i][0];
                q.offer(nums[i][0]);
                ans = sum * nums[i][1];
            }
        }
        return ans;
    }
}