LeetCode 1589 Maximum Sum Obtained of Any Permutation (排序，差分 推荐)

We have an array of integers, nums, and an array of requests where requests[i] = [starti, endi]. The ith request asks for the sum of nums[starti] + nums[starti + 1] + ... + nums[endi - 1] + nums[endi]. Both starti and endi are 0-indexed.

Return the maximum total sum of all requests among all permutations of nums.

Since the answer may be too large, return it modulo 10^9 + 7.

Example 1:

Input: nums = [1,2,3,4,5], requests = [[1,3],[0,1]]
Output: 19
Explanation: One permutation of nums is [2,1,3,4,5] with the following result: 
requests[0] -> nums[1] + nums[2] + nums[3] = 1 + 3 + 4 = 8
requests[1] -> nums[0] + nums[1] = 2 + 1 = 3
Total sum: 8 + 3 = 11.
A permutation with a higher total sum is [3,5,4,2,1] with the following result:
requests[0] -> nums[1] + nums[2] + nums[3] = 5 + 4 + 2 = 11
requests[1] -> nums[0] + nums[1] = 3 + 5  = 8
Total sum: 11 + 8 = 19, which is the best that you can do.

Example 2:

Input: nums = [1,2,3,4,5,6], requests = [[0,1]]
Output: 11
Explanation: A permutation with the max total sum is [6,5,4,3,2,1] with request sums [11].

Example 3:

Input: nums = [1,2,3,4,5,10], requests = [[0,2],[1,3],[1,1]]
Output: 47
Explanation: A permutation with the max total sum is [4,10,5,3,2,1] with request sums [19,18,10].

Constraints:

• n == nums.length
• 1 <= n <= 105
• 0 <= nums[i] <= 105
• 1 <= requests.length <= 105
• requests[i].length == 2
• 0 <= starti <= endi < n

题目链接：https://leetcode.com/problems/maximum-sum-obtained-of-any-permutation/

题目大意：requests数组每个元素代表一段区间，表示nums数组的下标范围，nums数组可任意排列，求requests数组中包含的nums区间和的最大值

题目分析：区间覆盖多的点放大的数值，问题是如何求区间覆盖，cnt[l]++，cnt[r+1]--，扫一下即可

20ms，时间击败56.4%

class Solution {
    public int maxSumRangeQuery(int[] nums, int[][] requests) {
        int n = nums.length;
        int[] cnt = new int[n];
        for (int i = 0; i < requests.length; i++) {
            cnt[requests[i][0]]++;
            if (requests[i][1] + 1 < n) {
                cnt[requests[i][1] + 1]--;
            }
        }

        for (int i = 1; i < n; i++) {
            cnt[i] += cnt[i - 1];
        }

        Arrays.sort(cnt);
        Arrays.sort(nums);
        long ans = 0;
        for (int i = n - 1, p = nums.length - 1; i >= 0 && p >= 0; i--) {
            ans = (ans + (long)nums[p--] * cnt[i]) % 1000000007;
        }
        return (int)ans;
    }
}