Leet Code Daily 2024-08-04 - Range Sum of Sorted Subarray Sums

constexpr int kMod = 1E9 + 7;

class Solution {
public:
    int rangeSum(vector<int>& nums, int n, int left, int right) {
        vector<int> sums;
        for (int i = 0; i < n; i++) {
            for (int j = i, s = 0; j < n; j++) {
                s = (s + nums[j]) % kMod;
                sums.push_back(s);
            }
        }
        sort(sums.begin(), sums.end());
        int ret = 0;
        for (int i = left - 1; i < right; i++) {
            ret = (ret + sums[i]) % kMod;
        }
        return ret;
    }
};