Subarray K-sums

Problem description. You are given an array A consisting of N integers. We are conducting research on the array and need a script that finds K-sums of different parts of the array. You are given the responsibility of creating this script! Formally, a K-sum for inputs l,r,k is defined as the sum of k largest elements in the subarray A[l,r] . It is guaranteed that k . Input Input description.