Range Sum of Sorted Subarray Sums

class Solution {
public:
    int rangeSum(vector<int>& nums, int n, int left, int right) {
        const int MOD = 1'000'000'007;
        vector<int> sums;
        sums.reserve(n * (n + 1) / 2);
        for (int i = 0; i < n; ++i) {
            int s = 0;
            for (int j = i; j < n; ++j) {
                s += nums[j];
                sums.push_back(s);
            }
        }
        sort(sums.begin(), sums.end());
        long ans = 0;
        for (int i = left - 1; i < right; ++i) ans = (ans + sums[i]) % MOD;
        return (int)ans;
    }
};

func rangeSum(nums []int, n int, left int, right int) int {
    const MOD = 1_000_000_007
    sums := make([]int, 0, n*(n+1)/2)
    for i := 0; i < n; i++ {
        s := 0
        for j := i; j < n; j++ {
            s += nums[j]
            sums = append(sums, s)
        }
    }
    sort.Ints(sums)
    ans := 0
    for i := left - 1; i < right; i++ {
        ans = (ans + sums[i]) % MOD
    }
    return ans
}

from typing import List

class Solution:
    def rangeSum(self, nums: List[int], n: int, left: int, right: int) -> int:
        MOD = 1_000_000_007
        sums: List[int] = []
        for i in range(n):
            s = 0
            for j in range(i, n):
                s += nums[j]
                sums.append(s)
        sums.sort()
        ans = 0
        for i in range(left - 1, right):
            ans = (ans + sums[i]) % MOD
        return ans

function rangeSum(nums, n, left, right) {
    const MOD = 1_000_000_007;
    const sums = [];
    for (let i = 0; i < n; i++) {
        let s = 0;
        for (let j = i; j < n; j++) {
            s += nums[j];
            sums.push(s);
        }
    }
    sums.sort((a, b) => a - b);
    let ans = 0;
    for (let i = left - 1; i < right; i++) ans = (ans + sums[i]) % MOD;
    return ans;
}

class Solution {
    public int rangeSum(int[] nums, int n, int left, int right) {
        final int MOD = 1_000_000_007;
        int[] sums = new int[n * (n + 1) / 2];
        int idx = 0;
        for (int i = 0; i < n; i++) {
            int s = 0;
            for (int j = i; j < n; j++) {
                s += nums[j];
                sums[idx++] = s;
            }
        }
        Arrays.sort(sums);
        long ans = 0;
        for (int i = left - 1; i < right; i++) ans = (ans + sums[i]) % MOD;
        return (int) ans;
    }
}

function rangeSum(nums: number[], n: number, left: number, right: number): number {
    const MOD = 1_000_000_007;
    const sums: number[] = [];
    for (let i = 0; i < n; i++) {
        let s = 0;
        for (let j = i; j < n; j++) {
            s += nums[j];
            sums.push(s);
        }
    }
    sums.sort((a, b) => a - b);
    let ans = 0;
    for (let i = left - 1; i < right; i++) ans = (ans + sums[i]) % MOD;
    return ans;
}