Implement a method to find the sum of the number k and m in the array

   subject ： Implement a method , Find the second in the array k And the first m Big numbers add up ;

Example ：

let arr = [1,2,4,4,3,5], k = 2, m = 4

findTopSum(arr, k, m); // The first 2 The big number is 4, appear 2 Time , The first 4 The big one is 2, appear 1 Time , So the result is 10

( His writing , Of course, there may be more brief code )

function bigSum(arr, k, m) {
    // Sort 
    arr = arr.sort(function (a, b) {
        return b - a;
    })
    console.log(' Descending array ', arr)
    // duplicate removal （ It's an object ）
    let newArr = new Set(arr);
    // Converted to an array 
    let arr1 = [...newArr]
    console.log(' Array after de duplication ', arr1);
    let temp1 = arr1[k - 1];
    let temp2 = arr1[m - 1];
    let total1 = 0;// Calculate the number of identical elements 
    let total2 = 0;
    arr.forEach((item) => {
        if (item == temp1) {
            total1++;
        }
        if (item == temp2) {
            total2++;
        }
    })
    return (temp1 * total1 + temp2 * total2);

}

let result = bigSum([2, 4, 2, 8, 4, 2, 4, 5], 3, 4)
console.log(' The result of the calculation is ', result);

link : js Several methods of array de duplication in